Abstract Communication Efficient Matrix Multiplication on Hypercubes

In this paper we present an efficient dense matrix multi-plication algorithm for distributed memory computers with a hypercube topology. The proposed algorithm performs better than all previously proposed algorithms for a wide range of matrix sizes and number of processors, especially for large matrices. We analyze the performance of the algorithms for two types of hypercube architectures, one in which each node can use (to send and receive.) at most one communication link at a time and the other & which eaeh node can use all communication links simultaneously