The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
ACM Transactions on Programming Languages and Systems (TOPLAS)
A high-speed sorting procedure
Communications of the ACM
Notes on merging networks (Prelimiary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A logarithmic time sort for linear size networks
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Tradeoffs for VLSI models with subpolynomial delay
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Merging and Sorting Networks with the Topology of the Omega Network
IEEE Transactions on Computers
The new class of g-chain periodic sorters
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Fault Tolerance in a Class of Sorting Networks
IEEE Transactions on Computers
Adaptive Binary Sorting Schemes and Associated Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Implementing Sorting Networks with Spiking Neural P Systems
Fundamenta Informaticae
Generic constant-round oblivious sorting algorithm for MPC
ProvSec'11 Proceedings of the 5th international conference on Provable security
Implementing Sorting Networks with Spiking Neural P Systems
Fundamenta Informaticae
| Hi-index | 0.01 |
This paper introduces a new sorting network, called the balanced sorting network, that sorts n items in O([lgn]2) time using (n/2)(lgn)2 comparators. Although these bounds are comparable to many existing sorting networks, the balanced sorting network possess some distinct advantages. In particular, its structure is highly regular consisting of a sequence of identicalbalanced merging networks. We prove that lg n identical merging networks are both necessary and sufficient to sort n items. We also present an explicit implementation of our network on the shuffle exchange interconnection model in which the direction of the comparitors are all identical and fixed.