Abstract
This paper studies the problem of sorting N items on a P processor parallel machine, where N≥P. The central result of the paper is a new algorithm, called cubesort, that sorts N=P1+1/k items in O(k P1/k log P) time using a P processor shuffle-exchange. Thus for any positive constant k, cubesort provides an asymptotically optimal speed-up over sequential sorting. Cubesort also sorts N = P log P items using a P processor shuffle-exchange in O(log3 P/loglog P) time. Both of these results are faster than any previously published algorithms for the given problems. Cubesort also provides asymptotically optimal sorting algorithms for a wide range of parallel computers, including the cube-connected cycles and the hypercube. An important extension of the central result is an algorithm that simulates a single step of a Priority-CRCW PRAM with N processors and N words of memory on a P processor shuffle-exchange machine in O(k P1/k log P) time, where N=P1+1/k.
Preview
Unable to display preview. Download preview PDF.
Bibliography
A. Aggarwal, Unpublished manuscript, 1986.
M. Ajtai, J. Komlos, E. Szemeredi, "An O(n log n) Sorting Network", Proc. 15th Annual Symposium on Theory of Computing, 1983, pp. 1–9.
K.E. Batcher, "Sorting Networks and their Applications", 1968 AFIPS Conference Proceedings, pp. 307–314.
G. Baudet, D. Stevenson, "Optimal Sorting Algorithms for Parallel Computers", IEEE Transactions on Computers, vol. c-27, no. 1, January 1978, pp. 84–87.
A. Borodin, J.E. Hopcroft, "Routing, Merging and Sorting on Parallel Models of Computation", Proc. 14th Annual Symposium on Theory of Computing, 1982, pp. 338–344.
A. Gottlieb, C.P. Kruskal, "Complexity Results for Permuting Data and Other Computations on Parallel Processors", Journal of the ACM, vol. 31, no. 2, April 1984, pp. 193–209.
D.E. Knuth, "The Art of Computer Programming, Vol. 3: Sorting and Searching", Addison-Wesley, Reading, MA, 1973.
T. Leighton, "Tight Bounds on the Complexity of Parallel Sorting", IEEE Transactions on Computers, vol. c-34, no. 4, April 1985, pp. 344–354.
T. Leighton, Personal communication..
D. Nassimi, S. Sahni, "Data Broadcasting in SIMD Computers", IEEE Transactions on Computers, vol. c-30, no. 2, February 1981, pp. 101–107.
F.P. Preparata, J. Vuillemin, "The Cube-Connected Cycles: A Versatile Network for Parallel Computation", Communications of the ACM, vol. 24, no. 5, May 1981, pp. 300–309.
H.S. Stone, "Parallel Processing with the Perfect Shuffle", IEEE Transactions on Computers, vol. c-20, no. 2, February 1971, pp. 153–161.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cypher, R., Sanz, J.L.C. (1988). Cubesort: An optimal sorting algorithm for feasible parallel computers. In: Reif, J.H. (eds) VLSI Algorithms and Architectures. AWOC 1988. Lecture Notes in Computer Science, vol 319. Springer, New York, NY. https://doi.org/10.1007/BFb0040412
Download citation
DOI: https://doi.org/10.1007/BFb0040412
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-96818-6
Online ISBN: 978-0-387-34770-7
eBook Packages: Springer Book Archive