Matrix-matrix multiplication on heterogeneous platforms

In this paper, we address the issue of implementing matrix-matrix multiplication on heterogeneous platforms. We target two different classes of heterogeneous computing resources: heterogeneous networks of workstations, and collections of heterogeneous clusters. Intuitively, the problem is to load ba...

Full description

Saved in:
Bibliographic Details
Published inProceedings 2000 International Conference on Parallel Processing pp. 289 - 298
Main Authors Beaumont, O., Boudet, V., Rastello, F., Robert, Y.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2000
Subjects
Computer networks
Concurrent computing
Distributed computing
Grid computing
Kernel
Linear algebra
Parallel machines
Personal communication networks
Pervasive computing
Workstations
Online AccessGet full text

Cover

More Information
Summary:In this paper, we address the issue of implementing matrix-matrix multiplication on heterogeneous platforms. We target two different classes of heterogeneous computing resources: heterogeneous networks of workstations, and collections of heterogeneous clusters. Intuitively, the problem is to load balance the work with different-speed resources while minimizing the communication volume. We formally state this problem and prove its NP-completeness. Next we introduce a (polynomial) column-based heuristic, which turns out to be very satisfactory: we derive a theoretical performance guarantee for the heuristic, and we assess its practical usefulness through MPI experiments.
ISBN:9780769507682
0769507689
ISSN:0190-3918
2332-5690
DOI:10.1109/ICPP.2000.876144