An efficient parallel sorting algorithm for shared memory multiprocessors
- 1 January 1992
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 18 (1) , 91-102
- https://doi.org/10.1016/0167-8191(92)90114-m
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Asynchronous parallel mergingParallel Computing, 1991
- A parallel sorting — merging algorithm for tightly coupled multiprocessorsParallel Computing, 1990
- Parallel sorting algorithms for tightly coupled multiprocessorsParallel Computing, 1988
- Analysis of the performance of the parallel quicksort methodBIT Numerical Mathematics, 1985
- Experience with Multiprocessor AlgorithmsIEEE Transactions on Computers, 1982
- Implementing Quicksort programsCommunications of the ACM, 1978