关键词：并行矩阵乘法；Strassen；分布式和高性能计算问题
摘 要：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 Strassen-based, both asymptotically and in practice.