Issue No. 12 - December (1983 vol. 32)
C.D. Thompson , Computer Science Division, University of California
The area-time complexity of sorting is analyzed under an updated model of VLSI computation. The new model makes a distinction between "processing" circuits and "memory" circuits; the latter are less important since they are denser and consume less power. Other adjustments to the model make it possible to compare pipelined and nonpipelined designs.
VLSI sorter, Area-time complexity, bitonic sort, bubble sort, heapsort, mesh-connected computers, parallel algorithms, shuffle-exchange network, sorting, VLSI
C. Thompson, "The VLSI Complexity of Sorting," in IEEE Transactions on Computers, vol. 32, no. , pp. 1171-1184, 1983.