The paper considers he problem of parallel external sorting in the contex of a form of heterogeneousclusters. We introduce two algorithms and we compare them two another one that we have previously developed. Since mo...
详细信息
ISBN:
(纸本)9780769519197
The paper considers he problem of parallel external sorting in the contex of a form of heterogeneousclusters. We introduce two algorithms and we compare them two another one that we have previously developed. Since most common sort algorithms assumehigh-speed random access to all intermediate memory,they are unsuitable if the values to be sorted don't fitin main memory. This is the case for cluster computing platforms which are made of standard, cheap andscarce components. For that class of computing resources a good use of I/O operations compatible withthe requirements of load balancing and computationalcomplexity are the key to success. We explore threetechniques and show how they can be deployed forclusters with processor performances related by a multiplicative factor. We validate the approaches in showing experimental results for the load balancing factor.
暂无评论