Abstract
An adaptive parallel sorting algorithm is presented, which is cost optimal with respect to the number of oscillations in a sequence (Osc). More specifically, the algorithm sorts any sequence X of length n in time O(log n) by using O(n/log n · log Osc(X)/n) CRCW PRAM processors. This is the first adaptive parallel sorting algorithm that is cost optimal with respect to Osc and, hence, it is also optimal with respect to both the number of inversions (Inv) and the number of runs (Runs) in the sequence. Our result improves previous results on adaptive parallel sorting.
This article was processed using the LaTEX macro package with LLNCS style
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Ajtai, J. Komlós, and E. Szemeredi: Sorting in c log n parallel steps. Combinatorica 3, 1–19 (1983)
T. Altman and B. S. Chlebus: Sorting roughly sorted sequences in parallel. Information Processing Letters 33, 297–300 (1989/90)
P. C. P. Bhatt, K. Diks, T. Hagerup, V. C. Prasad, T. Radzik, and S. Saxena: Improved deterministic parallel integer sorting. Inform. Comput. 94, 29–47 (1991)
S. Carlsson and J. Chen: An optimal parallel adaptive sorting algorithm. Information Processing Letters 39, 195–200 (1991)
J. Chen and S. Carlsson: On partitions and presortedness of sequences. Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, 62–71 (1991)
R. Cole: Parallel merge sort. SIAM Journal on Computing 17, 770–785 (1988)
R. Cole and U. Vishkin: Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time. SIAM Journal on Computing 17, 128–142 (1988)
C. R. Cook and D. J. Kim: Best sorting algorithm for nearly sorted lists. Communications of the ACM 23, 620–624 (1980)
E. W. Dijkstra: Smoothsort, an alternative for sorting in situ. Science of Computer Programming 1, 223–233 (1982)
R. G. Dromey: Exploiting partial order with quicksort. Software-Practice and Experience 14, 509–518 (1984)
V. Estivill-Castro and D. Wood: A new measure of presortedness. Information and Computation 83, 111–119 (1989)
C. Levcopoulos and O. Petersson: A note on adaptive parallel sorting. Information Processing Letters 33, 187–191 (1989)
C. Levcopoulos and O. Petersson: An optimal parallel algorithm for sorting presorted files. Proc. 8th Conf. Found. Soft. Tech. Theore. Comput. Sci., 154–160 (1988)
C. Levcopoulos and O. Petersson: Heapsort — adapted for presorted files. Proceedings of the First Workshop on Algorithms and Data Structures, 499–509 (1989)
H. Mannila: Measures of presortedness and optimal sorting algorithms. IEEE Transactions on Computers C-34, 318–325 (1985)
K. Mehlhorn: Data Structures and Algorithms Vol. 1: Sorting and Searching. Springer-Verlag, Berlin, Heidelberg, 1984.
O. Petersson: Adaptive sorting. Ph. D. Thesis, Lund University, Sweden (1990)
S. S. Skiena: Encroaching lists as a measure of presortedness. BIT 28, 775–784 (1988)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, J., Levcopoulos, C. (1992). Improved parallel sorting of presorted sequences. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_452
Download citation
DOI: https://doi.org/10.1007/3-540-55895-0_452
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55895-8
Online ISBN: 978-3-540-47306-0
eBook Packages: Springer Book Archive