| Abstract |
|
The paper considers he problem of parallel external sorting in the contex of a form of heterogeneous
clusters. We introduce two algorithms and we compare them two another one that we have previously developed. Since most common sort algorithms assume
high-speed random access to all intermediate memory,
they are unsuitable if the values to be sorted don’t fit
in main memory. This is the case for cluster computing platforms which are made of standard, cheap and
scarce components. For that class of computing resources a good use of I/O operations compatible with
the requirements of load balancing and computational
complexity are the key to success. We explore three
techniques and show how they can be deployed for
clusters with processor performances related by a multiplicative factor. We validate the approaches in showing experimental results for the load balancing factor.
|
 Additional Information
|
Index Terms- Out-of-Core parallel sorting algorithms
on clusters, Performance Evaluation and Modeling of
Parallel Integer Sorting Algorithms, Sorting by Regular Sampling and by Over-partitioning, Data Distribuion, I/O and resource management, Load Balancing
Citation:
Christophe Cérin, Hazem Fkaier, Mohamed Jemni,
"A Synthesis of P rallel Out-of-core Sorting Programs on Heterogeneous Clusters,"
ccgrid,
p. 78,
Third IEEE International Symposium on Cluster Computing and the Grid (CCGrid'03),
2003
|
