Communication Costs of Strassen's Matrix Multiplication.

Algorithms have historically been evaluated in terms of the number of arithmetic operations they performed. This analysis is no longer sufficient for predicting running times on today's machines. Moving data through memory hierarchies and among processors requires much more time (and energy) than pe...

Descripción completa

Detalles Bibliográficos

Publicado en:	Communications of the ACM Vol. 57; no. 2; pp. 107 - 115
Autores principales:	Ballard, Grey, Demmel, James, Holtz, Olga, Schwartz, Oded
Formato:	Artículo
Publicado:	Association for Computing Machinery Feb2014
Materias:	Algorithms Run time systems (Computer science) Memory hierarchy (Computer science) Computer input-output equipment Parallel algorithms Matrices (Mathematics) Communication models Partitions (Mathematics) Recursive functions
Acceso en línea:	Ver este registro en EBSCOhost