A Parallel Priority Queue with Constant Time Operations

Journal of Parallel and Distributed Computing

Volumn 49, Issue 1, 1998, Pages 4-21

  Brodal, Gerth Stølting ^a   Träff, Jesper Larsson ^a   Zaroliagis, Christos D ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Parallel data structures; parallel algorithms; graph algorithms; priority queues.

Indexed keywords

EID: 0040682152     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1998.1425     Document Type: Article

References (30)

1. Ahuja R. K., Magnanti T. L., Orlin J. B. Network Flows. 1993;Prentice-Hall, New York.
2. Brodal G. S. Priority queues on parallel machines. Proc. 5th Scandinavian Workshop on Algorithm Theory (SWAT). Lecture Notes in Computer Science. 1097:1996;Springer Verlag, Berlin. p. 416-427.
3. Brodal G. S. Worst-case efficient priority queues. Proc. 7th ACM-SIAM Symposium on Discrete Algorithms (SODA). 1996;. p. 52-58.
4. Brodal G. S., Träff J. L., Zaroliagis C. D. A parallel priority data structure with applications. Proceedings of the 11th International Parallel Processing Symposium (IPPS'97). 1997;. p. 689-693.
5. Chen D. Z., Hu X. Fast and efficient operations on parallel priority queues (preliminary version). Algorithms and Computation: 5th International Symposium, ISAAC '93. Lecture Notes in Computer Science. 834:1994;Springer-Verlag, Berlin. p. 279-287.
6. Cole R. Parallel merge sort. SIAM J. Comput. 17:1988;770-785.
7. Cook S., Dwork C., Reischuk R. Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM J. Comput. 15:1986;87-97.
8. Das S. K., Pinotti M. C., Sarkar F. Optimal and load balanced mapping of parallel priority queues in hypercubes. IEEE Trans. Parallel Distrib. Systems. 7:1996;555-564.
9. Deo N., Prasad S. Parallel heap: An optimal parallel priority queue. J. Supercomput. 6:1992;87-98.
10. Dietz P. F., Raman R. Very fast optimal parallel algorithms for heap construction. Proc. 6th Symposium on Parallel and Distributed Processing. 1994;. p. 514-521.
11. Dijkstra E. W. A note on two problems in connexion with graphs. Numer. Math. 1:1959;269-271.
12. Driscoll J. R., Gabow H. N., Shrairman R., Tarjan R. E. Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation. Commun. Assoc. Comput. Mach. 31:1988;1343-1354.
13. Fredman M. L., Tarjan R. E. Fibonacci heaps and their uses in improved network optimization algorithms. J. Assoc. Comput. Mach. 34:1987;596-615.
14. Goldberg A. V., Plotkin S. A., Vaidya P. M. Sublinear-time parallel algorithms for matching and related problems. J. Algorithms. 14:1993;180-213.
15. Goldschlager L. M., Shaw R., Staples J. The maximum flow problem is LOGSPACE complete for P. Theoret. Comput. Sci. 21:1982;105-111.
16. Hagerup T., Rüb C. Optimal merging and sorting on the EREW PRAM. Inform. Process. Lett. 33:1989;181-185.
17. Han Y., Pan V., Reif J. Algorithms for computing all pair shortest paths in directed graphs. Proc. 4th ACM Symposium on Parallel Algorithms and Architectures (SPAA). 1992;. p. 353-362.
18. Høyer P. A general technique for implementation of efficient priority queues. Proc. 3rd Israel Symposium on Theory of Computing and Systems. 1995;. p. 57-66.
19. JáJá J. An Introduction to Parallel Algorithms. 1992;Addison-Wesley, Reading.
20. Karp R. M., Ramachandran V. Parallel Algorithms for Shared-Memory Machines. Handbook of Theoretical Computer Science. 1990;Elsevier, Amsterdam/New York. p. 869-942.
21. Karp R., Upfal E., Wigderson A. Constructing a maximum matching is in random NC. Combinatorica. 6:1986;35-38.
22. Mehlhorn K. Data Structures and Algorithms. EATCS Monographs on Theoretical Computer Science. 1:1984;Springer-Verlag, Berlin/New York.
23. Mulmuley K., Vazirani U. V., Vazirani V. V. Matching is as easy as matrix inversion. Combinatorica. 7:1987;105-113.
24. Okasaki C. Purely functional random-access lists. Proc. 7th Int. Conference on Functional Programming Languages and Computer Architecture. 1995;ACM Press. p. 86-95.
25. Paige R. C., Kruskal C. P. Parallel algorithms for shortest path problems. Int. Conference on Parallel Processing. 1985;. p. 14-20.
26. Pinotti M. C., Das S. K., Crupi V. A. Parallel and distributed meldable priority queues based on binomial heaps. Proc. 25th Int. Conference on Parallel Processing. 1996;IEEE Computer Society Press. p. 255-262.
27. Pinotti M. C., Pucci G. Parallel priority queues. Inform. Process. Lett. 40:1991;33-40.
28. Pinotti M. C., Pucci G. Parallel algorithms for priority queue operations. Theoret. Comput. Sci. 148:1995;171-180.
29. Ranade A., Cheng S., Deprit E., Jones J., Shih S. Parallelism and locality in priority queues. Proc. 6th Symposium on Parallel and Distributed Processing. 1994;. p. 490-496.
30. Träff J. L., Zaroliagis C. D. Simple parallel algorithm for the single-source shortest path problem on planar digraphs. Parallel Algorithms for Irregularly Structured Problems (IRREGULAR'96). Lecture Notes in Computer Science. 1117:1996;Springer-Verlag, Berlin. p. 183-194.