The complexity of sorting on distributed systems
Information and Control
Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks
IEEE Transactions on Computers
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Sorting on a mesh-connected parallel computer
Communications of the ACM
Serial Array Time Slot Interchangers and Optical Implementations
IEEE Transactions on Computers
Minimizing Communication in the Bitonic Sort
IEEE Transactions on Parallel and Distributed Systems
Generalized Algorithm for Parallel Sorting on Product Networks
IEEE Transactions on Parallel and Distributed Systems
A generalized fault-tolerant sorting algorithm on a product network
Journal of Systems Architecture: the EUROMICRO Journal
On Sorting Multiple Bitonic Sequences
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
Efficient implementation of sorting on multi-core SIMD CPU architecture
Proceedings of the VLDB Endowment
Optimal conclusive sets for comparator networks
Theoretical Computer Science
Accelerating certain outputs of merging and sorting networks
Theoretical Computer Science
Optimal conclusive sets for comparator networks
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Bitonic sorters of minimal depth
Theoretical Computer Science
| Hi-index | 14.99 |
The k-way bitonic sort algorithm, a generalization of K.E. Batcher's bitonic sort algorithm (1968), is presented. This variation of the algorithm is based on a k-way decomposition instead of a two-way decomposition. It is proven that Batcher's bitonic sequence decomposition theorem still holds with this multiway decomposition. This leads to applications of sorting networks with bitonic sorters of arbitrary or mixed sizes.