Bounds to Complexities of Networks for Sorting and for Switching
Journal of the ACM (JACM)
Parallel permutation and sorting algorithms and a new generalized connection network
Journal of the ACM (JACM)
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Tight bounds on the complexity of parallel sorting
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A complexity theory for VLSI
Aspects of information flow in VLSI circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer
IEEE Transactions on Parallel and Distributed Systems
Tight bounds on the complexity of parallel sorting
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
A generalization of a known class of parallel sorting algorithms is presented, together with a new interconnection to execute them. A VLSI implementation is also proposed, and its area-time performance is discussed. It is shown that an algorithm in the class is executable in O(logn) time by a chip occupying O(n2) area. The design is a typical instance of a “hybrid architecture”, resulting from the combination of well-known VLSI networks as the orthogonal trees and the cube-connected-cycles; it also provably meets the AT2&equil;omegan2log2n) lower bound for sorters of n words of length (1+\epsilon)logn(\epsilon O).