Title: High-speed parallel external sorting of data with arbitrary distribution

Authors: Minsoo Jeon, Dongseung Kim

Addresses: ©Smart Solutions, 5th floor, Newton Plaza Building, 771 Yoksam-Dong, Kangnam-Gu, Seoul 135-080, Korea. ' Department of Electrical Engineering, Korea University, Seoul 136-701, Korea

Abstract: Many parallel sorting algorithms of external disk data have been reported such as NOW-sort, SPsort, hill sort and so on. They all reduce the execution time compared with some known sequential sort; however, they differ in terms of the speed, throughput or cost-effectiveness. Mostly, they deal with uniformly distributed data in their value range. If we divide and redistribute data to processors by fixed and equal division of the key range, all processors will have about equal numbers of keys to sort and store. But if irregularly distributed data are given, the performance will suffer severely as the partitioning would no longer produce balanced loads among processors. Few research results have been reported for parallel external sort of data with arbitrary distribution. In this paper, we develop two distribution-insensitive scalable parallel external sorting algorithms that use sampling technique and histogram counts to achieve even distribution of keys, which eventually contribute to achieve good performance. Experimental results on a cluster of 16 Linux workstations show up to threefold enhancement of the performance compared with NOW-sort for sorting 16 GB integer keys.

Keywords: external sorting; NOW-sort; sample sort; cluster; load balancing; histogram counts; high-speed parallel sorting; external disk data; sampling; arbitrary distribution; high performance computing.

DOI: 10.1504/IJHPCN.2004.009266

International Journal of High Performance Computing and Networking, 2004 Vol.2 No.1, pp.36 - 44

Published online: 14 Mar 2006 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article