Parallel sorting by regular sampling
- 1 April 1992
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 14 (4) , 361-372
- https://doi.org/10.1016/0743-7315(92)90075-x
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An algorithm with decentralized control for sorting files in a networkJournal of Parallel and Distributed Computing, 1989
- Data communication in hypercubesJournal of Parallel and Distributed Computing, 1989
- Parallel sorting algorithms for tightly coupled multiprocessorsParallel Computing, 1988
- A benchmark parallel sort for shared memory multiprocessorsIEEE Transactions on Computers, 1988
- Problem-heap: A paradigm for multiprocesor algorithmsParallel Computing, 1987
- The parallel neighbour sort and 2-way merge algorithmParallel Computing, 1986
- Distributed SortingIEEE Transactions on Computers, 1985
- Analysis of the performance of the parallel quicksort methodBIT Numerical Mathematics, 1985
- Experience with Multiprocessor AlgorithmsIEEE Transactions on Computers, 1982
- Clustering techniques: The user's dilemmaPattern Recognition, 1976