Parallel integer sorting with medium and fine-scale parallelism
Journal Article
·
· International Journal of High Speed Computing; (Singapore)
- Computer Science Corp., Moffett Field, CA (United States)
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.
- Research Organization:
- National Aeronautics and Space Administration, Moffett Field, CA (United States). Ames Research Center
- OSTI ID:
- 6682691
- Journal Information:
- International Journal of High Speed Computing; (Singapore), Journal Name: International Journal of High Speed Computing; (Singapore) Vol. 5:4; ISSN IHSCEZ; ISSN 0129-0533
- Country of Publication:
- United States
- Language:
- English
Similar Records
A vector-parallel implementation and statistical analysis of the bucket sort on a vector-parallel distributed memory system: Lessons learned in the integer sort NAS parallel benchmark
Performance of a plasma fluid code on the Intel parallel computers
Data parallel sorting for particle simulation
Conference
·
Thu Nov 30 23:00:00 EST 1995
·
OSTI ID:125626
Performance of a plasma fluid code on the Intel parallel computers
Conference
·
Sat Oct 31 23:00:00 EST 1992
·
OSTI ID:10138745
Data parallel sorting for particle simulation
Journal Article
·
Fri May 01 00:00:00 EDT 1992
· Concurrency. Practice and Experience; (United Kingdom)
·
OSTI ID:6726397