External Sorting in VLSI

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.

[1]  Gérard M. Baudet,et al.  Optimal Sorting Algorithms for Parallel Computers , 1978, IEEE Transactions on Computers.

[2]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[3]  Franco P. Preparata,et al.  Area-Time Optimal VLSI Networks for Multiplying Matrices , 1980, Inf. Process. Lett..

[4]  Hiroto Yasuura,et al.  The Parallel Enumeration Sorting Scheme for VLSI , 1982, IEEE Transactions on Computers.

[5]  S. N. Maheshwari,et al.  Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees , 1983, IEEE Transactions on Computers.

[6]  Thompson.  The VLSI Complexity of Sorting , 1983, IEEE Transactions on Computers.

[7]  F. Leighton.  New lower bound techniques for VLSI , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).