Brief announcement: strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds

Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz. Brief announcement: strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds. In Guy E. Blelloch, Maurice Herlihy, editors, 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '12, Pittsburgh, PA, USA, June 25-27, 2012. pages 77-79, ACM, 2012. [doi]

Abstract

Abstract is missing.