Parallel matrix multiplication is one of the most studied fundamental
problems in distributed and high performance computing.
We obtain a new parallel algorithm that is based on
Strassen's fast matrix multiplication and minimizes communication.
The algorithm outperforms all known parallel matrix
multiplication algorithms, classical and Strassenbased, both
asymptotically and in practice.
A critical bottleneck in parallelizing Strassen's algorithm
is the communication between the processors. Ballard, Demmel,
Holtz, and Schwartz (SPAA'11) prove lower bounds on
these communication costs, using expansion properties of the
underlying computation graph. Our algorithm matches these
lower bounds, and so is communicationoptimal. It exhibits
perfect strong scaling within the maximum possible range.
