We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
7.6.2. 子策略组合优化, 平铺展开后的矩阵乘法代码中
// 这里是核心计算逻辑,划分成不同层次使得每次循环计算的数据能够放入cache中 C[cse_var_1] = (C[cse_var_1] + (A[((cse_var_2 + (k.outer*4)) + n.inner)] * B[((((k.outer*4096) + (k.inner*1024)) + cse_var_3) + n.inner)]))
应该是
// 这里是核心计算逻辑,划分成不同层次使得每次循环计算的数据能够放入cache中 C[cse_var_1] = (C[cse_var_1] + (A[((cse_var_2 + (k.outer*4)) + k.inner)] * B[((((k.outer*4096) + (k.inner*1024)) + cse_var_3) + n.inner)]))
吧? A[((cse_var_2 + (k.outer4)) + n.inner)] --> A[((cse_var_2 + (k.outer4)) + k.inner)]
The text was updated successfully, but these errors were encountered:
No branches or pull requests
7.6.2. 子策略组合优化, 平铺展开后的矩阵乘法代码中
应该是
吧?
A[((cse_var_2 + (k.outer4)) + n.inner)] --> A[((cse_var_2 + (k.outer4)) + k.inner)]
The text was updated successfully, but these errors were encountered: