pdf

Research on Optimization of Matrix Multiplication Algorithm

  • 2013-09-19
  • 144.55KB
  • Points it Requires : 2

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.

unfold

You Might Like

Uploader
rubyonrails
 

Recommended ContentMore

Popular Components

Just Take a LookMore

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京ICP证060456号 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号
×