Optimal VLSI Sorting with Reduced Number of Processors

A new parallel architecture is presented which has p processors and N=n/sup 2/ memory locations, each consisting of 2s bits. The proposed organization can sort N s-bit numbers, where s=O((1+ epsilon ) log N), epsilon >0, in time t=O(N log N/p), for p in the range 1 to square root N log square root N. This result is optimal in the sense that the product of the number of processors and the parallel sorting time is equal to the sequential complexity of sorting. Also, the constant factors involved in the algorithm complexity are relatively small. When p= square root N log square root N, the time required for sorting N numbers on the proposed organization is O( square root N), which is the same time required by a two-dimensional mesh array, a mesh of trees organization, or a pyramid computer, all with O(N) processors, to sort N numbers. >

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

[2]  Viktor K. Prasanna,et al.  A VLSI-Based Multiprocessor Architecture for Implementing Parallel Algorithms , 1985, International Conference on Parallel Processing.

[3]  Eli Upfal,et al.  Efficient schemes for parallel communication , 1982, PODC '82.

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

[5]  Leslie G. Valiant,et al.  A logarithmic time sort for linear size networks , 1987, JACM.

[6]  Robert Michael Owens,et al.  VLSI Sorting with Reduced Hardware , 1984, IEEE Transactions on Computers.

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

[8]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[9]  Franco P. Preparata,et al.  A Minimum Area VLSI Network for O(log n) Time Sorting , 1985, IEEE Transactions on Computers.

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

[11]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[12]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[13]  János Komlós,et al.  An 0(n log n) sorting network , 1983, STOC.

[14]  Sartaj Sahni,et al.  Bitonic Sort on a Mesh-Connected Parallel Computer , 1979, IEEE Transactions on Computers.

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

[16]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1977, CACM.

[17]  Selim G. Akl,et al.  Parallel Sorting Algorithms , 1985 .

[18]  Frank Thomson Leighton,et al.  Tight Bounds on the Complexity of Parallel Sorting , 1985, IEEE Trans. Computers.

[19]  Adi Shamir,et al.  Shear Sort: A True Two-Dimensional Sorting Techniques for VLSI Networks , 1986, ICPP.