Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.12188/17246
DC FieldValueLanguage
dc.contributor.authorRistov, Sashkoen_US
dc.contributor.authorGushev, Marjanen_US
dc.contributor.authorAnchev, Nenaden_US
dc.contributor.authorAtanasovski, Blagojen_US
dc.date.accessioned2022-04-05T08:24:28Z-
dc.date.available2022-04-05T08:24:28Z-
dc.date.issued2013-06-24-
dc.identifier.urihttp://hdl.handle.net/20.500.12188/17246-
dc.description.abstractDense 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.en_US
dc.publisherIEEEen_US
dc.subjectHPC, CPU, Cache, Performanceen_US
dc.titleSome Optimization Techniques of the Matrix Multiplication Algorithmen_US
dc.typeProceeding articleen_US
dc.relation.conferenceProceedings of the ITI 2013 35th international conference on information technology interfacesen_US
item.fulltextWith Fulltext-
item.grantfulltextopen-
crisitem.author.deptFaculty of Computer Science and Engineering-
crisitem.author.deptFaculty of Computer Science and Engineering-
Appears in Collections:Faculty of Computer Science and Engineering: Conference papers
Files in This Item:
File Description SizeFormat 
How_to_optimize_a_matrix_multiplication_algorithm_v2.6.pdf149.75 kBAdobe PDFView/Open
Show simple item record

Page view(s)

24
checked on May 11, 2024

Download(s)

31
checked on May 11, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.