Load-Balanced Parallel Merge Sort on Distributed Memory Parallel Computers

Authors:
Minsoo Jeon;Dongseung Kim
Affiliations:
-;-
Venue:
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Year:
2002

Citing 10
Cited 1

Parallel merge sort

SIAM Journal on Computing
Parallel sorting by regular sampling

Journal of Parallel and Distributed Computing
Fast Parallel Sorting Under LogP: Experience with the CM-5

IEEE Transactions on Parallel and Distributed Systems
Load balanced parallel radix sort

ICS '98 Proceedings of the 12th international conference on Supercomputing
Samplesort: A Sampling Approach to Minimal Storage Tree Sorting

Journal of the ACM (JACM)
Partitioned parallel radix sort

Journal of Parallel and Distributed Computing
Parallel Median Splitting and k-Splitting with Application to Merging and Sorting

IEEE Transactions on Parallel and Distributed Systems
Communication-Efficient Bitonic Sort on a Distributed Memory Parallel Computer

ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems
Sorting networks and their applications

AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Paper: Performance parameters and benchmarking of supercomputers

Parallel Computing

External sorting for index construction of large semantic web databases

Proceedings of the 2010 ACM Symposium on Applied Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implemented on distributed memory computers has poor performance due to the successive reduction of the number of active (non-idling) processors by a half, up to one in the last merging stage. This paper presents load-balanced parallel merge sort algorithm where all processors participate in merging throughout the computation. Data are evenly distributed to all processors, and every processor is forced to work in merging phase. Significant enhancement of the performance has been achieved. Our analysis shows the upper bound of the speedup of the merge time as (P -1)= logP. We have had a speedup of 9.6 (upper bound is 10.5) on 32-processor Cray T3E in sorting of 4M 32-bit integers. The same idea can be applied to parallellize other sorting algorithms.