NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Parallel integer sorting with medium and fine-scale parallelismTwo 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.
Document ID
19950028507
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
Authors
Dagum, Leonardo
(Computer Science Corp. Moffett Field, CA, United States)
Date Acquired
August 16, 2013
Publication Date
January 1, 1993
Publication Information
Publication: International Journal of High Speed Computing
Volume: 5
Issue: 4
ISSN: 0129-0533
Subject Category
Computer Programming And Software
Report/Patent Number
NAS 2-12961
Accession Number
95A60106
Distribution Limits
Public
Copyright
Other

Available Downloads

There are no available downloads for this record.
No Preview Available