K-Way Bitonic Sort

The k-way bitonic sort algorithm, a generalization of K.E. Batcher's bitonic sort algorithm (1968), is presented. This variation of the algorithm is based on a k-way decomposition instead of a two-way decomposition. It is proven that Batcher's bitonic sequence decomposition theorem still holds with this multiway decomposition. This leads to applications of sorting networks with bitonic sorters of arbitrary or mixed sizes. >

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

[2]  Linda Pagli,et al.  External Sorting in VLSI , 1984, IEEE Transactions on Computers.

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

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

[5]  Chak-Kuen Wong,et al.  On the Complexity of Sorting in Magnetic Bubble Memory Systems , 1980, IEEE Transactions on Computers.

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

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

[8]  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).

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

[10]  Shing-Tsaan Huang,et al.  Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks , 1986, IEEE Transactions on Computers.

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

[12]  Harold S. Stone Sorting on STAR , 1978, IEEE Transactions on Software Engineering.

[13]  Ching C. Hsiao,et al.  k-Fold Bitonic Sort on a Mesh-Connected Parallel Computer , 1985, Inf. Process. Lett..

[14]  Robert Michael Owens,et al.  Parallel Sorting with Serial Memories , 1985, IEEE Transactions on Computers.

[15]  Samuel E. Orcutt Implementation of Permutation Functions in Illiac IV-Type Computers , 1976, IEEE Transactions on Computers.

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

[17]  Michael C. Loui The Complexity of Sorting on Distributed Systems , 1984, Inf. Control..

[18]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[19]  Jayanata Banerjee,et al.  Parallel Bitonic Record Sort - An Effective Algorithm for the Realization of a Post Processor. , 1979 .

[20]  Franco P. Preparata,et al.  An Architecture for Bitonic Sorting with Optimal VLSI Performnance , 1984, IEEE Transactions on Computers.