Scalability of Parallel Algorithms for Matrix Multiplication

Authors:
Anshul Gupta;Vipin Kumar
Affiliations:
University of Minnesota, USA;University of Minnesota, USA
Venue:
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 03
Year:
1993

Citing 0
Cited 2

Algorithm-system scalability of heterogeneous computing

Journal of Parallel and Distributed Computing
Using simulation to design extremescale applications and architectures: programming model exploration

ACM SIGMETRICS Performance Evaluation Review - Special issue on the 1st international workshop on performance modeling, benchmarking and simulation of high performance computing systems (PMBS 10)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A number of parallel formulations of dense matrix multiplication algorithm have been developed. For arbitrarily large number of processors, any of these algorithms or their variants can provide near linear speedup for sufficiently large matrix sizes and none of the algorithms can be clearly claimed to be superior than the others. In this paper we analyze the performance and scalability of a number of parallel formulations of the matrix multiplication algorithm and predict the conditions under which each formulation is better than the others.