Odd-even, compare-exchange parallel sorting

Abstract We present a parallel sorting algorithm and its proof which sorts a sequence of n elements in time O(log2n) with n/2 processors on an EREW-PRAM computational model. A sorting network directly implements the algorithm using O(n·log n)PEs. The algorithm is based on the elementary Compare-Exchange operation and has the advantage that it does not require a powerful computational model, uses the least amount of space for the sorting problem, has small constants and can be implemented directly on a sorting network. Furthermore, the architecture of the network is simple and makes no unrealistic technological assumptions.

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

[2]  Weixiong Zhang,et al.  Optimal parallel quicksort on EREW PRAM , 1991, BIT Comput. Sci. Sect..

[3]  Bogdan S. Chlebus.  A Parallel Bucket Sort , 1988, Inf. Process. Lett..

[4]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[5]  Frank Harary,et al.  Graph Theory , 2016 .

[6]  D. T. LEE,et al.  An On-Chip Compare/Steer Bubble Sorter , 1981, IEEE Transactions on Computers.

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

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

[9]  E. Szemerédi,et al.  O(n LOG n) SORTING NETWORK. , 1983 .

[10]  Frank Thomson Leighton,et al.  Tight Bounds on the Complexity of Parallel Sorting , 1984, IEEE Transactions on Computers.

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

[12]  F. S. Wong,et al.  Parallel Sorting on a Re-Circulating Systolic Sorter , 1984, Comput. J..

[13]  Manoj Kumar,et al.  An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes , 1983, IEEE Transactions on Computers.

[14]  Clyde P. Kruskal,et al.  Searching, Merging, and Sorting in Parallel Computation , 1983, IEEE Transactions on Computers.

[15]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1976, STOC '76.

[16]  Selim G. Akl,et al.  Optimal Parallel Merging and Sorting Without Memory Conflicts , 1987, IEEE Transactions on Computers.

[17]  Daniel S. Hirschberg.  Fast parallel sorting algorithms , 1978, CACM.

[18]  Sartaj Sahni,et al.  Parallel permutation and sorting algorithms and a new generalized connection network , 1982, JACM.

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

[20]  Alexandru Nicolau,et al.  Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines , 1989, SIAM J. Comput..

[21]  Uzi Vishkin,et al.  Finding the Maximum, Merging, and Sorting in a Parallel Computation Model , 1981, J. Algorithms.

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