Abstract
We present an optimal algorithm for sortingn integers in the range [1,n c] (for any constantc) for the EREW PRAM model where the word length isn ε, for any ε>0. Using this algorithm, the best known upper bound for integer sorting on the (O(logn) word length) EREW PRAM model is improved. In addition, a novel parallel range reduction algorithm which results in a near optimal randomized integer sorting algorthm is presented. For the case when the keys are uniformly distributed integers in an arbitrary range, we give an algorithm whose expected running time is optimal.
Similar content being viewed by others
References
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Reading, MA: Addison-Wesley 1974
Ajtai, M., Komlós, J., Szemerédi, E.: AnO(n logn) sorting network. Combinatorica3, 1–19 (1983)
Angluin, D., Valiant, L.G.: Fast probabilistic algorithms for hamiltonian paths and matchings. J. Comput. Syst. Sci.18, 155–193 (1979)
Bhatt, P., Diks, K., Hagerup, T., Prasad, V., Radzik, T., Saxena, S.: Improved deterministic parallel integer sorting. (Unpublished manuscript, 1989)
Chernoff, H.: Measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat.23, 493–507 (1952)
Chlebus, H.: Parallel iterated bucket sort. Inf. Process. Lett.31, 181–183 (1989)
Cole, R.: Parallel merge sort. SIAM J. Comput.17, 770–785 (1988)
Cole, R.: An optimally efficient selection algorithm. Inf. Process. Lett.26, 295–299 (1988)
Cole, R., Vishkin, U.: Faster optimal parallel prefix sums and list ranking. Inf. Comput.81, 334–352 (1989)
Hagerup, T.: Towards optimal parallel bucket sorting. Inf. Comput.75, 39–51 (1987)
Hagerup, T.: Hybridsort revisited and parallelized. Inf. Process. Lett.32, 35–39 (1989)
Kirkpatrick, D., Reisch, S.: Upper bounds for sorting integers on random access machines. Theor. Comput. Sci.28, 263–276 (1984)
Knuth, D.E.: The art of computer programming, vol. 3: sorting and searching. Reading, MA: Addison-Wesley 1973
Kruskal, C., Rudolph, L., Snir, M.: Efficient parallel algorithms for graph problems. Algorithmica5, 43–64 (1990)
Ladner, R.E., Fischer, M.J.: Parallel prefix computation. J. ACM27, 831–838 (1980)
MacLaren, M.D.: Internal sorting by radix plus sifting. J. ACM13, 404–411 (1966)
Mehlhorn, K.: Data structures and algorithms 1: Sorting and searching (EATCS Monographs, vol. 1), Berlin Heidelberg New York: Springer 1984
Rajasekaran, S., Reif, J.H.: Optimal and sublogarithmic time randomized parallel sorting algorithms. SIAM J. Comput.18, 594–607 (1989)
Reif, J.H., Valiant, L.: A logarithmic time sort for linear size networks. J. ACM34, 60–76 (1987)
Reischuk, R.: Probabilistic parallel algorithms for sorting and selection. SIAM J. Comput.14, 396–409 (1985)
Shiloach, Y., Vishkin, U.: Finding the maximum, merging, and sorting in a parallel computation model. J. Algorithms2, 81–102 (1981)
Author information
Authors and Affiliations
Additional information
Supported by NSF-DCR-85-03251 and ONR contract N00014-87-K-0310
Rights and permissions
About this article
Cite this article
Rajasekaran, S., Sen, S. On parallel integer sorting. Acta Informatica 29, 1–15 (1992). https://doi.org/10.1007/BF01178563
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01178563