Answers are grounded in this paper and cite their sources.
We propose a class of designs of a new interconnection network, the pleated cube-connected cycles (PCCC), which can impleement stable bitonic sorting of n records of size q in area A = O(q 2 n 2 /T 2 ), where T, the computation time, is in the range [Ω(q log 2 n), O(q √n/(q+ log n))]. Thus, this network is an AT 2,/R -optimal bitonic sorter in the synchronous VLSI model of computation under the word-local restriction.
No takes yet. Share an insight, caveat, or question.
Bilardi et al. (1984) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: