The Community for Technology Leaders
Green Image
ABSTRACT
The first parallel sort algorithm for shared memory MIMD (multiple-instruction-multiple-data-stream) multiprocessors that has a theoretical and measured speedup near linear is exhibited. It is based on a novel asynchronous parallel merge that evenly partitions data to be merged among any number of processors. A benchmark sorting algorithm is proposed that uses this merge to remove the linear ti
INDEX TERMS
benchmark; parallel sort; shared memory multiprocessors; sort algorithm; MIMD; multiprocessors; Sequent Balance 21000 System; computer testing; parallel algorithms; sorting.
CITATION

R. Francis and I. Mathieson, "A Benchmark Parallel Sort for Shared Memory Multiprocessors," in IEEE Transactions on Computers, vol. 37, no. , pp. 1619-1626, 1988.
doi:10.1109/12.9738
84 ms
(Ver 3.3 (11022016))