Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds

14 February 2012

Papers citing "Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds"

2 / 2 papers shown

Title
Communication-Optimal Parallel Algorithm for Strassen's Matrix Multiplication Grey Ballard J. Demmel Olga Holtz Benjamin Lipshitz O. Schwartz 66 137 0 14 Feb 2012
Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard J. Demmel Olga Holtz O. Schwartz 77 119 0 08 Sep 2011