Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12188/17246
Title: | Some Optimization Techniques of the Matrix Multiplication Algorithm | Authors: | Ristov, Sashko Gushev, Marjan Anchev, Nenad Atanasovski, Blagoj |
Keywords: | HPC, CPU, Cache, Performance | Issue Date: | 24-Jun-2013 | Publisher: | IEEE | Conference: | Proceedings of the ITI 2013 35th international conference on information technology interfaces | 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. | URI: | http://hdl.handle.net/20.500.12188/17246 |
Appears in Collections: | Faculty of Computer Science and Engineering: Conference papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
How_to_optimize_a_matrix_multiplication_algorithm_v2.6.pdf | 149.75 kB | Adobe PDF | View/Open |
Page view(s)
30
checked on Nov 9, 2024
Download(s)
118
checked on Nov 9, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.