Implementation Analysis of Fast Matrix Multiplication Algorithms on Shared Memory Computers
E. Francomano ; A. Tortotici Macaluso ; M. Vajteršic
Computing and Informatics, Tome 28 (2012) no. 1, / Harvested from Computing and Informatics
Text on Computing and Informatics
The paper presents analysis of matrix multiplication algorithms from the point of view of their efficient implementation on shared memory machines. The algorithms of Winograd and Strassen have been analyzed and implemented considering the memory accesses, the stride and data transfer overheads. A particular attention is paid to the parallel implementation of the modified recurrence-free variant of the Strassen's algorithm.
Publié le : 2012-01-26
Classification:  
@article{cai232,
     author = {E. Francomano and A. Tortotici Macaluso and M. Vajter\v sic},
     title = {Implementation Analysis of Fast Matrix Multiplication Algorithms on Shared Memory Computers},
     journal = {Computing and Informatics},
     volume = {28},
     number = {1},
     year = {2012},
     language = {en},
     url = {http://dml.mathdoc.fr/item/cai232}
}

E. Francomano; A. Tortotici Macaluso; M. Vajteršic. Implementation Analysis of Fast Matrix Multiplication Algorithms on Shared Memory Computers. Computing and Informatics, Tome 28 (2012) no. 1, . http://gdmltest.u-ga.fr/item/cai232/