The Pairwise Sorting Network

A new sorting network with exactly the same size and depth as the odd-even sorting network is presented. This sorting network is designed using the zero-one principle, and proceeds by first sorting pairs of bits and then sorting the pairs into lexicographic order.

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

[2]  Ian Parberry,et al.  Parallel complexity theory , 1987, Research notes in theoretical computer science.

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

[4]  Ian Parberry,et al.  Constructing Sorting Networks from k-Sorters , 1989, Inf. Process. Lett..

[5]  Michael E. Saks,et al.  The periodic balanced sorting network , 1989, JACM.

[6]  Donald E. Knuth,et al.  Sorting and Searching , 1973 .

[7]  János Komlós,et al.  Sorting in c log n parallel sets , 1983, Comb..

[8]  Ian Parberry.  On the Computational Complexity of Optimal Sorting Network Verification , 1991, PARLE.

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

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