Title :
External Sorting in VLSI
Author :
Bonuccelli, M.A. ; Lodi, E. ; Pagli, L.
Author_Institution :
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.
Keywords :
Bitonic sort; VLSI; external sorting; merge sort; mesh of trees; time complexity; Appropriate technology; Binary trees; Concurrent computing; Registers; Sorting; Very large scale integration; Bitonic sort; VLSI; external sorting; merge sort; mesh of trees; time complexity;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1984.1676356
