Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
- 1 April 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 18 (2) , 216-228
- https://doi.org/10.1137/0218014
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Merging and sorting networks with the topology of the omega networkIEEE Transactions on Computers, 1989
- Routing, merging, and sorting on parallel models of computationJournal of Computer and System Sciences, 1985
- An Architecture for Bitonic Sorting with Optimal VLSI PerformnanceIEEE Transactions on Computers, 1984
- Searching, Merging, and Sorting in Parallel ComputationIEEE Transactions on Computers, 1983
- Parallel Sorting with Constant Time for ComparisonsSIAM Journal on Computing, 1981
- The cube-connected cycles: a versatile network for parallel computationCommunications of the ACM, 1981
- A fast parallel algorithm for routing in permutation networksIEEE Transactions on Computers, 1981
- Bitonic Sort on a Mesh-Connected Parallel ComputerIEEE Transactions on Computers, 1979
- New Parallel-Sorting SchemesIEEE Transactions on Computers, 1978
- The Indirect Binary n-Cube Microprocessor ArrayIEEE Transactions on Computers, 1977