Issue No. 10 - October (1984 vol. 33)
M.A. Bonuccelli , Dipartimento di Informatica, Universita di Pisa
The problem of sorting n elements using VLSI chips that can sort only q(q < n) elements at a time is considered. The proposed VLSI chip consists of a mesh of trees. Two classical algorithms, i.e., merge sort and bitonic sort, are modified to efficiently solve the external sorting problem using this chip.
VLSI, Bitonic sort, external sorting, merge sort, mesh of trees, time complexity
E. Lodi, M.A. Bonuccelli, L. Pagli, "External Sorting in VLSI", IEEE Transactions on Computers, vol. 33, no. , pp. 931-934, October 1984, doi:10.1109/TC.1984.1676356