Improving Parallel Execution Time of Sorting on Heterogeneous Clusters

Authors:
Christophe Cerin;Michel Koskas;Hazem Fkaier;Mohamed Jemni
Affiliations:
Université de Picardie Jules Verne, France;Université de Picardie Jules Verne, France;École Supérieure des Sciences et Techniques de Tunis, Tunisie;École Supérieure des Sciences et Techniques de Tunis, Tunisie
Venue:
SBAC-PAD '04 Proceedings of the 16th Symposium on Computer Architecture and High Performance Computing
Year:
2004

Citing 0
Cited 2

Mining traces of large scale systems

ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
Methods for partitioning data to improve parallel execution time for sorting on heterogeneous clusters

GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

The aim of the paper is to introduce techniques in order to optimize the parallel execution time of sorting on heterogeneous platforms (processors speeds are related by a constant factor). We develop a constant time technique for mastering processor load balancing and execution time in an heterogeneous environment. We develop an analytical model for the parallel execution time, sustained by preliminary experimental results in the case of a 2-processors systems. The computation of the solution is independent of the problem size. Consequently, there is no overhead regarding the sorting problem.