A Comparison Based Parallel Sorting Algorithm
Authors:
- 1 August 1993
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3 (01903918) , 196-200
Abstract
We present a fast comparison based parallel sorting algorithm that can handle arbitrary key types. Data movement is the major portion of sorting time for most algorithms in the literature. Our algorithm is parameterized so that is can be tuned to control data movement time, especially for large data sets. Parallel histograms are used to partition the key set exactly. The algorithm is architecture independent, and has been implemented in the CHARM portable parallel programming system, allowing it to be efficiently run on virtually any MIMD computer. Performance results for sorting different data sets are presented.Keywords
This publication has 3 references indexed in Scilit:
- A comparison of sorting algorithms for the connection machine CM-21991
- A balanced bin sort for hypercube multicomputersThe Journal of Supercomputing, 1988
- Samplesort: A Sampling Approach to Minimal Storage Tree SortingJournal of the ACM, 1970