Abstract
This paper presents parallel algorithms for priority queue operations on a p-processor EREW-PRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is obtained as an extension of the traditional binary-heap organization. Using an MH, it is shown that insertion of a new item or deletion of the smallest item from a priority queue of n elements can be performed in O log n/p + log log n) parallel time, while construction of an MH from a set of n items takes O(n/p+log n) time. The given algorithms for insertion and deletion achieve the best possible running time for any number of processors p, with p ∈ O(log n/log log n), while the MH construction algorithm employs up to Θ(n/log n) processors optimally.
This work has been supported by the C.N.R. project “Sistemi Informatici e Calcolo Parallelo”. Part of this research was done while G. Pucci was visiting the International Computer Science Institute, Berkeley, California.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
B.Auerbuch and Y.Shiloach, New Connectivity and MSF Algorithms for Ultracomputer and PRAM, in: Proc. of the 1983 Int. Conf. on Parallel Processing (1983) 298–319.
J.Biswas and J.C.Browne, Simultaneous Update of Priority Structures, in: Proc. of the 1987 Int. Conf. on Parallel Processing (1987) 124–131.
T.H.Cormen, C.E.Leiserson and R.L.Rivest, Introduction to Algorithms (MIT Press, Cambridge Mass., 1990).
J.M.Driscoll, H.V.Gabow, R.Shrairman and R.E.Tarjan, Relaxed Heaps: An Alternative to Fibonacci Heaps with Applications to Parallel Computation, Communications of the ACM 31(11) (1988) 1343–1354.
R.M.Karp and V.Ramachandran, Parallel Algorithms for Shared-Memory Machines, in: J.van Leeuween, ed., Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (Elsevier, Amsterdam, 1990) 870–941.
S.Olariu and Z.Wen, An Optimal Parallel Construction Scheme for Heap-like Structures, in: Proc. Twenty-eight Allerton Conf. on Communication, Control, and Computing (1990) 936–937.
V.N.Rao and V.Kumar, Concurrent Access of Priority Queues, IEEE Trans. on Computers C-37(12) (1988) 1657–1665.
V.N.Rao and W.Zhang, Building Heaps in Parallel, Information Processing Letters 37 (1991) 355–358.
W.Zhang and R.Korf, Parallel Heap Operations on EREW PRAM, in: Proc. Sixth Int. Parallel Processing Symp. (1992) 315–318.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pinotti, M.C., Pucci, G. (1992). Parallel algorithms for priority queue operations. In: Nurmi, O., Ukkonen, E. (eds) Algorithm Theory — SWAT '92. SWAT 1992. Lecture Notes in Computer Science, vol 621. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55706-7_12
Download citation
DOI: https://doi.org/10.1007/3-540-55706-7_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55706-7
Online ISBN: 978-3-540-47275-9
eBook Packages: Springer Book Archive