Abstract
The Parallel Priority Queue (PPQ) data structure supports parallel operations for manipulating data items with keys, such as inserting n new items, deleting n items with the smallest keys, creating a new PPQ that contains a set of items, and melding two PPQ's into one. In this paper, we present fast and efficient parallel algorithms for implementing operations on the PPQ's that maintain data items with real-valued keys. The data structures that we use for implementing the PPQ's are the unmeldable and meldable parallel heaps. Our algorithms have considerably smaller time and/or work bounds than the previously best known algorithms, and use a less powerful parallel computational model (the EREW PRAM). The new ideas that make our improvement possible are two partition schemes dynamically maintained on the parallel heap structures: the minimal-path partition and the right-path partition. These partition schemes could be of interest in their own right. Our results also lead to optimal parallel algorithms for implementing sequential operations on several traditional heap structures.
Research supported in part by the New Faculty Research Support Program grant from Western Michigan University.
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. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka. “A simple parallel tree contraction algorithm”, J. of Algorithms, 10 (2) (1989), pp. 287–302.
A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
F. Bauernoppel and H. Jung. “Implementing abstract data structures in hardware”, Proc. 13th Conf. Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 324, 1988, Springer, Berlin, pp. 172–179.
G. Bilardi and A. Nicolau. “Adaptive bitonic sorting: An optimal parallel algorithm for sharedmemory machines”, SIAM J. Comput., 18 (1989), pp. 216–228.
J. Biswas and J. C. Browne. “Simultaneous update of priority structures,” Proc. Int. Conf. Parallel Processing, 1987, pp. 124–131.
R. P. Brent. “The parallel evaluation of general arithmetic expressions”, J. of the ACM, 21 (2) (1974), pp. 201–206.
R. Cole. “Parallel merge sort”, SIAM J. Comput, 17 (4) (1988), pp. 770–785.
S. K. Das and W.-B. Horng. “Managing a parallel heap efficiently,” Proc. of Parallel Architectures and Languages Europe, 1991, Lecture Notes on Computer Science, Vol. 505, Springar-Verlag, pp. 270–287.
N. Deo and S. Prasad. “Parallel heap”, Proc. Int. Conf. Parallel Processing, Vol. III, 1990, pp. 169–172.
T. Hagerup and C. Rub. “Optimal merging and sorting on the EREW PRAM”, Inform. Process. Lett., 33 (1989), pp. 181–185.
D. W. Jones. “Concurrent operations on priority queues”, C. of the ACM, 32 (1) (1989), pp. 132–137.
R. Karp, M. Saks, and A. Wigderson. “On a search problem related to branch-and-bound procedures,” Proc. 27th Annual Symp. on Foundations of Computer Science, 1986, pp. 19–28.
D. E. Knuth. The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley, Reading, MA, 1973.
C. P. Kruskal, L. Rudolph, and M. Snir. “The power of parallel prefix”, IEEE Trans. Comput., C-34 (1985), pp. 965–968.
R. E. Ladner and M. J. Fischer. “Parallel prefix computation”, J. of the ACM, 27 (4) (1980), pp. 831–838.
T.-W. Lai and S. Sahni. “Anomalies in parallel branch-and-bound algorithms”, C. of the ACM, 27 (6) (1984), pp. 594–602.
T.-W. Lai and A. Sprague. “Performance of parallel branch-and-bound algorithms”, IEEE Trans. Comput., C-34 (10) (1985), pp. 962–964.
G.-J. Li and B. W. Wah. “Coping with anomalies in parallel branch-and-bound algorithms”, IEEE Trans. Comput., C-35 (6) (1986), pp. 568–573.
W. Paul, U. Vishkin, and H. Wagener. “Parallel dictionaries on 2–3 trees”, Tech. Report 70, Courant Inst., New York Univ., 1983. Also Proc. 10th Int. Colloquium on Automata, Languages, and Programming (ICALP), Lecture Notes in Computer Science 154, Springer, Berlin, pp. 597–609, 1983.
M. C. Pinotti and G. Pucci. “Parallel priority queues”, Inform. Process. Letters, 40 (1991), pp. 33–40.
S. Prasad and N. Deo. “Parallel heap: Improved and simplified”, Proc. of the 6th Int. Parallel Processing Symp., 1992, pp. 448–451.
M. J. Quinn and Y. B. Yoo. “Data structures for the efficient solutions of graph theoretic problems on tightly-coupled MIMD computers”, Proc. Int. Conf. Parallel Processing, 1984, pp. 431–438.
V. N. Rao and V. Kumar. “Concurrent access of priority queues”, IEEE Trans. Comput., C-37 (12) (1988), pp. 1657–1665.
R. E. Tarjan. Data Structures and Network Algorithms, SIAM, Philadelphia, Pennsylvania, 1983.
B. Wah and Y. Ma. “MANIP — A parallel computer system for implementing branch-and-bound algorithms”, Proc. 8th Annual Symp. Comput. Archit., 1982, pp. 239–262.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, D.Z., Hu, X.(. (1994). Fast and efficient operations on Parallel Priority Queues. In: Du, DZ., Zhang, XS. (eds) Algorithms and Computation. ISAAC 1994. Lecture Notes in Computer Science, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58325-4_191
Download citation
DOI: https://doi.org/10.1007/3-540-58325-4_191
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58325-7
Online ISBN: 978-3-540-48653-4
eBook Packages: Springer Book Archive