4- https://doi.org/10.1142/s0129053393000219
PARALLEL INTEGER SORTING WITH MEDIUM AND FINE-SCALE PARALLELISM
- Dec 1, 1993
- International Journal of High Speed Computing
- Leonardo Dagum
Abstract
Two new parallel integer sorting algorithms, queue-sort and barrel-sort, are presented and analyzed in detail. These algorithms do not have optimal parallel complexity, yet they show very good performance in practice. Queue-sort designed for fine-scale parallel architectures which allow the queueing of multiple messages to the same destination. Barrel-sort is designed for medium-scale parallel architectures with a high message passing overhead. The performance results from the implementation of queue-sort on a Connection Machine CM-2 and barrel-sort on a 128 processor iPSC/860 are given. The two implementations are found to be comparable in performance but not as good as a fully vectorized bucket sort on the Cray YMP.
- # Connection Machine CM-2
- # Cray YMP
- # Machine CM-2
- # Connection Machine
- # Performance In Practice
- # Parallel Sorting Algorithms
- # Parallel Architectures
- # Queueing Of Messages
- # Parallel Sorting
- # Good Performance
