Abstract
We consider the problem of constructing data structures that implement priority queues (viz. the heap) and double-ended priority queues (namely, the twin-heap, the min-max heap, and the deap) quickly and optimally in parallel. Whereas all these heap-like structures can be built in linear sequential time, we show in this paper that the construction problem can be solved in O(log n·log* n/log log n) time using n·log log n/log n·log * n processors in the Arbitrary CRCW PRAM model. Moreover, by applying random sampling techniques, we reduce the construction time to O with probability ≥ 1−n−c for some constant c>0. As a by-product, we also investigate the parallel complexity of the multiple selection problem. The problem is to select a subset of elements having specified ranks from a given set. We design optimal solutions to the problem with respect to various models of parallel computation.
Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho, J. E. Hopocroft, and J. D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Massachusetts, 1974.
S. G. Akl: The Design and Analysis of Parallel Algorithms. Prentice-Hall, Englewood Cliffs, New Jersey, 1989.
M. D. Atkinson, J.-R. Sack, N. Santoro, and Th. Strothotte: Min-max heaps and generalized priority queues. Communications of the ACM 29 (10) (1986), 996–1000.
Y. Azar and N. Pippenger: Parallel selection. Discrete Applied Mathematics 27 (1–2) (1990), 49–58.
M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan: Time bounds for selection. Journal of Computer and System Sciences 7 (4) (1973), 448–461.
R. P. Brent: The parallel evaluation of general arithmetic expressions. Journal of the ACM 21 (2) (1974), 201–206.
S. Carlsson: The deap — A double-ended heap to implement double-ended priority queues. Information Processing Letters 26 (1) (1987), 33–36.
S. Carlsson and J. Chen: Parallel constructions of heaps and min-max heaps. Parallel Processing Letters 2 (4) (1992), 311–320.
J. Chen: Constructing priority queues and deques optimally in parallel. Proceedings of the Twelfth World Computer Congress, Volume I, (J. van Leeuwen, Ed.) Madrid, Spain (1992), 275–283.
R. J. Cole: An optimally efficient selection algorithm. Information Processing Letters 26 (1987/88) 295–299.
R. J. Cole: Parallel merge sort. SIAM Journal on Computing 17 (1988) 770–785.
R. J. Cole and U. Vishkin: Faster optimal prefix sums and list ranking. Information and Control 81 (1989) 334–352.
P. F. Dietz: Heap construction in the parallel comparison tree model. In: Proceedings of the 3rd Scandinavian Workshop on Algorithm Theory (1992), 140–150.
R. W. Floyd: Algorithm 245 — Treesort 3. Communications of the ACM 7 (12) (1964), 701.
R. W. Floyd and R. L. Rivest: Expected time bounds for selection. Communications of the ACM 18 (1975) 165–172.
M. L. Fredman and T. H. Spencer: Refined complexity analysis for heap operations. Journal of Computer and System Sciences 35 (3) (1987), 269–284.
G. H. Gonnet and J. I. Munro: Heaps on heaps. SIAM Journal on Computing 15 (4) (1986), 964–971.
D. E. Knuth: The Art of Computer Programming. Vol. 3: Sorting and Searching. Addison-Wesley, Reading, Massachusetts, 1973.
S. Rajasekaran and J. H. Reif: Derivation of randomized sorting and selection algorithms. Technical Report, Aiken Computing Lab., Harvard University, 1987.
N. S. V. Rao and W. Zhang: Building heaps in parallel. Information Processing Letters 37 (1991) 355–358.
Th. Strothotte, P. Eriksson, and S. Vallner: A note on constructing min-max heaps. BIT 29 (2) (1989), 251–256.
L. G. Valiant: Parallelism in comparison problems. SIAM Journal on Computing 4 (1975) 348–355.
J. W. J. Williams: Algorithm 232: Heapsort. Communications of the ACM 7 (6) (1964), 347–348.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, J. (1994). Parallel heap construction using multiple selection. In: Buchberger, B., Volkert, J. (eds) Parallel Processing: CONPAR 94 — VAPP VI. VAPP CONPAR 1994 1994. Lecture Notes in Computer Science, vol 854. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58430-7_33
Download citation
DOI: https://doi.org/10.1007/3-540-58430-7_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58430-8
Online ISBN: 978-3-540-48789-0
eBook Packages: Springer Book Archive