Deterministic sorting in nearly logarithmic time on the hypercube and related computers

Abstract This paper presents a deterministic sorting algorithm, called Sharesort, that sorts n records on an n -processor hypercube, shuffle-exchange, or cube-connected cycles in O (log n (log log n ) 2 ) time in the worst case. The algorithm requires only a constant amount of storage at each processor. The fastest previous deterministic algorithm for this problem was Batcher's bitonic sort, which runs in O (log 2 n ) time.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

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

[4]  Sartaj Sahni,et al.  Data broadcasting in SIMD computers , 1981, IEEE Transactions on Computers.

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

[6]  Sartaj Sahni,et al.  A Self-Routing Benes Network and Parallel Permutation Algorithms , 1981, IEEE Transactions on Computers.

[7]  Sartaj Sahni,et al.  Parallel Algorithms to Set Up the Benes Permutation Network , 1982, IEEE Transactions on Computers.

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

[9]  John P. Fishburn,et al.  Quotient Networks , 1982, IEEE Transactions on Computers.

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

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

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

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

[14]  Richard Cole,et al.  A Parallel Median Algorithm , 1985, Inf. Process. Lett..

[15]  Leslie G. Valiant,et al.  A logarithmic time sort for linear size networks , 1982, STOC.

[16]  Lawrence Snyder,et al.  Efficient communication in massively parallel computers , 1989 .

[17]  Eli Upfal,et al.  An O(logN) deterministic packet routing scheme , 1989, STOC '89.

[18]  Ernst W. Mayr,et al.  Efficient computation on sparse interconnection networks , 1989 .

[19]  A. Kolmogorov,et al.  Mathematics: Its Content, Methods and Meaning , 1990 .

[20]  Eli Upfal,et al.  An O(log N) deterministic packet-routing scheme , 1992, JACM.