Load Balancing , Selection and Sorting on the HypercubeC

This paper presents novel load balancing, selection and sorting algorithms for the hypercube with 1-port communication. The main result is an algorithm for sorting n values on p processors, SmoothSort, that runs asymptotically faster (in the worst case) than any previously known algorithm over a wide range of the ratio n=p. The load balancing and selection algorithms upon which SmoothSort is based are expected to be of independent interest. Although the analysis of our algorithms is limited to obtaining asymptotic bounds, the constant factors being ignored are quite small.

[1]  L. H. Harper.  Optimal numberings and isoperimetric problems on graphs , 1966 .

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

[3]  Gérard M. Baudet,et al.  Optimal Sorting Algorithms for Parallel Computers , 1978, IEEE Transactions on Computers.

[4]  Zoltán Füredi,et al.  A short proof for a theorem of Harper about Hamming-spheres , 1981, Discret. Math..

[5]  Allan Borodin,et al.  Efficient Searching Using Partial Ordering , 1981, Inf. Process. Lett..

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

[7]  Lennart Johnsson,et al.  Combining Parallel and Sequential Sorting on a Boolean n–cube , 1984 .

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

[9]  Eli Upfal,et al.  The token distribution problem , 1989, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[10]  S. Lennart Johnsson,et al.  Distributed Routing Algorithms for Broadcasting and Personalized Communication in Hypercubes , 1986, ICPP.

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

[12]  Jorge L. C. Sanz,et al.  Cubesort: An Optimal Sorting Algorithm for Feasible Parallel Computers , 1988, AWOC.

[13]  Rajeev Motwani,et al.  Deferred Data Structuring , 1988, SIAM J. Comput..

[14]  Alok Aggarwal,et al.  Network Complexity of Sorting and Graph Problems and Simulating CRCW PRAMS by Interconnection Networks , 1988, AWOC.