Short communication: Communication-efficient matrix multiplication on hypercubes

Authors:
Himanshu Gupta;P. Sadayappan
Affiliations:
Department of Computer Science, Stanford University, Stanford, CA 94305, USA;Department of Computer and Info. Science, The Ohio State University, Columbus, OH 43210, USA
Venue:
Parallel Computing
Year:
1996

Citing 4
Cited 1

Optimum Broadcasting and Personalized Communication in Hypercubes

IEEE Transactions on Computers
Communication efficient matrix multiplication on hypercubes

SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Some Complexity Results for Matrix Computations on Parallel Processors

Journal of the ACM (JACM)
A cellular computer to implement the kalman filter algorithm

A cellular computer to implement the kalman filter algorithm

Matrix Multiplication on the OTIS-Mesh Optoelectronic Computer

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present an efficient dense matrix multiplication 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 in which each node can use all communication links simultaneously.