Sorting Networks of Logarithmic Depth, Further Simplified

Abstract We further simplify Paterson’s version of the Ajtai–Komlós–Szemerédi sorting network, and its analysis, mainly by tuning the invariant to be maintained.

[1]  E. Szemerédi,et al.  Sorting inc logn parallel steps , 1983 .

[2]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[3]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[4]  Vašek Chvátal.  Lecture Notes on the New AKS Sorting Network , 1992 .

[5]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[6]  Mike Paterson,et al.  Improved sorting networks withO(logN) depth , 1990, Algorithmica.

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

[8]  H. Manos.  Construction of Halvers , 1999, Inf. Process. Lett..

[9]  V. E. Alekseev.  Sorting algorithms with minimum memory , 1969 .

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

[11]  János Komlós,et al.  Halvers and Expanders , 1992, FOCS 1992.

[12]  Selim G. Akl.  Parallel computation: models and methods , 1997 .

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

[14]  Donald E. Knuth,et al.  The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .

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

[16]  Selim G. Akl,et al.  Design and analysis of parallel algorithms , 1985 .

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

[18]  Nicholas Pippenger.  CHAPTER 15 – Communication Networks , 1990 .

[19]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[20]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[21]  János Komlós,et al.  Halvers and expanders (switching) , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[22]  Wojciech Rytter,et al.  Efficient parallel algorithms , 1988 .

[23]  M. V. Wilkes,et al.  The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .

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

[25]  Nicholas Pippenger.  Communication Networks , 1932, Nature.