On the versatility of parallel sorting by regular sampling
- 1 October 1993
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 19 (10) , 1079-1103
- https://doi.org/10.1016/0167-8191(93)90019-h
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Parallel sorting by regular samplingJournal of Parallel and Distributed Computing, 1992
- An efficient parallel sorting algorithm for shared memory multiprocessorsParallel Computing, 1992
- Sorting with linear speedup on a pipelined hypercubeIEEE Transactions on Computers, 1992
- A network multi‐processor for experiments in parallelismConcurrency: Practice and Experience, 1991
- A balanced bin sort for hypercube multicomputersThe Journal of Supercomputing, 1988
- Parallel sorting algorithms for tightly coupled multiprocessorsParallel Computing, 1988
- A benchmark parallel sort for shared memory multiprocessorsIEEE Transactions on Computers, 1988
- Distributed SortingIEEE Transactions on Computers, 1985
- Clustering techniques: The user's dilemmaPattern Recognition, 1976