Abstract
A parallel version of the double distributive partitioning sorting algorithm is described, and two versions of this algorithm are compared on a MIMD shared memory multiprocessor. A “reclaimer” version, in which child processes completely build their page tables before starting useful work, exhibitsO(n/p) expected-case time complexity for a wide class of distributions.
Similar content being viewed by others
References
P. J. Janus and E. A. Lamagna,An adaptive method for unknown distributions in distributive partitioned sorting, IEEE Trans. on Comp. C-34, no. 4 (1985), pp. 367–372.
M. T. Noga and D. C. S. Allison,Sorting in linear expected time, BIT 25 (1985), pp. 451–465.
C. A. R. Hoare,Quicksort (Algorithm 64), CACM 4, no. 7 (1961), p. 321.
N. Y. Yousif and D. J. Evans,Parallel distributive partitioned sorting methods, International J. Computer Math. 15 (1984), pp. 231–254.
W. Dobosiewicz,Sorting by distributive partitioning, Info. Proc. Lett. 7, no. 1 (1978), pp. 1–6.
D. C. S. Allison and M. T. Noga,USORT: An efficient hybrid of distributive partitioning sorting, BIT 22 (1982), pp. 135–139.
R. W. Sedgewick,Implementing quicksort programs, CACM 21, no. 10 (1978), pp. 847–856.
L. Devroye and T. Klincsek,Average time behavior of distributive sorting algorithms, Computing 26, no. 1 (1981), pp. 1–7.
N. Wirth,Algorithms+Data Structures=Programs, Prentice-Hall (1976), pp. 60–61.
H. Meijer and S. G. Akl,The design and analysis of a new hybrid sorting algorithm, Info. Proc. Lett. 10, no. 4–5 (1980), pp. 213–218.
M. J. Flynn,Some computer organizations and their effectiveness, IEEE Trans. Comput., C-21 (1972), pp. 948–960.
M. van der Nat,A fast sorting algorithm, a hybrid of distributive and merge sorting, Info. Proc. Lett. 10, no. 3 (1980), pp. 163–167.
J. S. Kowalik and Y. B. Yoo,Implementing a distributive sort program, Journal of Information and Optimalization Sciences 2, no. 1 (1981), pp. 28–33.
Author information
Authors and Affiliations
Additional information
Work performed under the auspices of Lockheed Independent Research Grant 86RDD502.
Rights and permissions
About this article
Cite this article
Noga, M.T. Sorting in parallel by double distributive partitioning. BIT 27, 340–348 (1987). https://doi.org/10.1007/BF01933729
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01933729