This paper proposes a variety of optimization methods for the classic matrix multiplication A*B algorithm: based on the principle of locality, it is proposed to transpose matrix B; nested loop blocks are performed according to the size of the computer cache and the scale of matrix A and matrix B, and the optimal block size is obtained by adjusting and comparing the block size; loop unrolling technology is used to improve the parallelism of the program. Experimental results show that the optimized algorithm shortens the running time and obtains better running efficiency.
You Might Like
Recommended ContentMore
Open source project More
Popular Components
Searched by Users
Just Take a LookMore
Trending Downloads
Trending ArticlesMore