The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (1984 vol.33)
pp: 931-934
M.A. Bonuccelli , Dipartimento di Informatica, Universita di Pisa
ABSTRACT
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.
INDEX TERMS
VLSI, Bitonic sort, external sorting, merge sort, mesh of trees, time complexity
CITATION
M.A. Bonuccelli, E. Lodi, L. Pagli, "External Sorting in VLSI", IEEE Transactions on Computers, vol.33, no. 10, pp. 931-934, October 1984, doi:10.1109/TC.1984.1676356
45 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool