Answers are grounded in this paper and cite their sources.
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(log n) 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= Ω(n2log2n) lower bound for sorters of n words of length (1 + ε) log n (ε > 0).
No takes yet. Share an insight, caveat, or question.
Bilardi et al. (1985) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: