Communication efficient matrix multiplication on hypercubes

Authors:
Himanshu Gupta;P. Sadayappan
Affiliations:
Department of Computer and Information Science, Ohio State University, Columbus OH;Department of Computer and Information Science, Ohio State University, Columbus OH
Venue:
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Year:
1994

Citing 3
Cited 4

Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
Optimum Broadcasting and Personalized Communication in Hypercubes

IEEE Transactions on Computers
A cellular computer to implement the kalman filter algorithm

A cellular computer to implement the kalman filter algorithm

Short communication: Communication-efficient matrix multiplication on hypercubes

Parallel Computing
Modeling parallel bandwidth: local vs. global restrictions

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Memory efficient parallel matrix multiplication operation for irregular problems

Proceedings of the 3rd conference on Computing frontiers
Software persistent memory

USENIX ATC'12 Proceedings of the 2012 USENIX conference on Annual Technical Conference

Quantified Score

Hi-index	0.01

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.