DocumentCode :
1960172
Title :
Some optimization techniques of the matrix multiplication algorithm
Author :
Anchev, N. ; Gusev, Marjan ; Ristov, Sasko ; Atanasovski, B.
Author_Institution :
Fac. of Comput. Sci. & Eng., Ss. Cyril & Methodius Univ., Skopje, Macedonia
fYear :
2013
fDate :
24-27 June 2013
Firstpage :
71
Lastpage :
76
Abstract :
Dense matrix-matrix multiplication algorithm is widely used in large scientific applications, and often it is an important factor of the overall performance of the application. Therefore, optimizing this algorithm, both for parallel and serial execution would give an overall performance boost. In this paper we overview the most used dense matrix multiplication optimization techniques applicable for multicore processors. These methods can speedup the multicore parallel execution focusing on reducing the number of memory accesses and improving the algorithm according to hardware architecture and organization.
Keywords :
matrix multiplication; multiprocessing systems; optimisation; parallel architectures; dense matrix-matrix multiplication algorithm; hardware architecture; multicore parallel execution; multicore processors; optimization techniques; scientific applications; Algorithm design and analysis; Computer architecture; Computers; Hardware; Optimization; Prefetching; CPU; Cache; HPC; Performance;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Technology Interfaces (ITI), Proceedings of the ITI 2013 35th International Conference on
Conference_Location :
Cavtat
ISSN :
1334-2762
Print_ISBN :
978-953-7138-30-1
Type :
conf
DOI :
10.2498/iti.2013.0572
Filename :
6649000
Link To Document :
بازگشت