A Parallel Priority Data Structure with Applications

Authors:
Gert Stølting Brodal;Jesper Larsson Träff;Cristos D. Zaroliagis
Affiliations:
-;-;-
Venue:
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Year:
1997

Citing 8
Cited 3

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation

Communications of the ACM
Parallel merge sort

SIAM Journal on Computing
Efficient parallel algorithms for computing all pair shortest paths in directed graphs

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Worst-case efficient priority queues

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Priority Queues on Parallel Machines

SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs

IRREGULAR '96 Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems
A general technique for implementation of efficient priority queues

ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)

Delta-Stepping: A Parallel Single Source Shortest Path Algorithm

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A parallel priority queueing system with finite buffers

Journal of Parallel and Distributed Computing
Spurious minima and basins of attraction in higher-order Hopfield networks

IWANN'03 Proceedings of the Artificial and natural neural networks 7th international conference on Computational methods in neural modeling - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Presents a parallel priority data structure that improves the running time of certain algorithms for problems that lack a fast and work-efficient parallel solution. As a main application, we give a parallel implementation of Dijkstra's (1959) algorithm which runs in O(n) time while performing O(m log n) work on a CREW PRAM. This is a logarithmic factor improvement for the running time compared with previous approaches. The main feature of our data structure is that the operations needed in each iteration of Dijkstra's algorithm can be supported in O(1) time.