Abstract
This paper presents an improved lower bound on Conway's parallel sorting algorithm. It is shown that Conway's parallel sorting algorithm sorts N keys in (N+[N/2]-2) cycles, where [X] denotes the smallest integer which is larger than or equal to X. The original result proposed by Warshauer is (2N-3) cycles. With this improvement it can be saved (N-[N/2]-1) cycles for N keys. Consequently it is shown that 50(1-2/N) percent of cycles can be saved on the sorting process. Also with this improvement the modified algorithm for average behavior proposed by the authors in an earlier paper will become more efficient.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. U. Ahmed and D. Y. Yeh. Time Efficient Implementation of Conway's Parallel Sorting Algorithm. 1988 International Computer Symposium, Tamkang University, Taipei, Taiwan, Dec 15–17, 1988.
D. E. Knuth. Sorting and Searching. In the Art of Computer Programming Vol 3, Addison-Wesley, Reading, Mass. 1973.
M. L. Warshauer. Conway's Parallel Sorting Algorithm. Journal of Algorithms 7 (1986), 270–276.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahmed, K.U., Yeh, DY. (1991). A note on Conway's parallel sorting algorithm. In: Sherwani, N.A., de Doncker, E., Kapenga, J.A. (eds) Computing in the 90's. Great Lakes CS 1989. Lecture Notes in Computer Science, vol 507. Springer, New York, NY. https://doi.org/10.1007/BFb0038486
Download citation
DOI: https://doi.org/10.1007/BFb0038486
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97628-0
Online ISBN: 978-0-387-34815-5
eBook Packages: Springer Book Archive