Scalability Analysis of Matrix-Matrix Multiplication on Heterogeneous Clusters

Authors:
Alexey Kalinov
Affiliations:
Russian Academy of Sciences
Venue:
ISPDC '04 Proceedings of the Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks
Year:
2004

Citing 0
Cited 6

On performance analysis of heterogeneous parallel algorithms

Parallel Computing
Scalability of heterogeneous parallel systems

Programming and Computing Software
Parallel techniques for information extraction from hyperspectral imagery using heterogeneous networks of workstations

Journal of Parallel and Distributed Computing
An experimental comparison of parallel algorithms for hyperspectral analysis using heterogeneous and homogeneous networks of workstations

Parallel Computing
Measuring the scalability of heterogeneous parallel systems

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Performance analysis of overheads for matrix – vector multiplication in cluster environment

PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper is devoted to scalability analysis of a typical linear algebra algorithm on heterogeneous clusters. We proof that traditional scalability metrics proposed for analysis of linear algebra algorithms is applicable on heterogeneous platform and investigate influence of three heterogeneous strategies of computation distribution to Scalable Universal Matrix Multiplication Algorithm (SUMMA) scalability.