Theoretical scalability analysis for heterogeneous clusters

Authors:
J. L. Bosque;L. P. Perez
Affiliations:
ESCET, Univ. Rey Juan Carlos, Madrid, Spain;ESCET, Univ. Rey Juan Carlos, Madrid, Spain
Venue:
CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
Year:
2004

Citing 0
Cited 3

Algorithm-system scalability of heterogeneous computing

Journal of Parallel and Distributed Computing
Scalability limits of Bag-of-Tasks applications running on hierarchical platforms

Journal of Parallel and Distributed Computing
Introducing grid speedup Γ: a scalability metric for parallel applications on the grid

EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scalability is one key concept for analyzing the performance of parallel systems, specially in clusters and Grid environments. Even though heterogeneous systems are becoming more common, there is no suitable definition of this concept for studying their behaviour. This paper presents an extension of the isoefficiency method that permits its application to heterogeneous environments as well. The heterogeneous isoefficiency function can predict the system scalability independently of the algorithm nature. This method is based only on the algorithm's overhead time and an adequate workload distribution. This paper also presents a set of theoretical scalability analyses, and finally some experiments where the method's usefulness and validity are shown.