Priority queues on parallel machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1097, Issue , 1996, Pages 416-427

  Brodal, Gerth Stølting ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

QUEUEING THEORY;

CONSTANT FACTORS; CONSTANT TIME; EREW PRAM; K ELEMENTS; PARALLEL MACHINE; PRIORITY QUEUES; PROCESSOR ARRAY;

PIPELINE PROCESSING SYSTEMS;

EID: 84880324264     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61422-2_150     Document Type: Conference Paper

References (20)

1. Gerth Stølting Brodal. Fast meldable priority queues. In Proc. 4th Workshop on Algorithms and Data Structures (WADS), volume 955 of Lecture Notes in Computer Science, pages 282-290. Springer Verlag, Berlin, 1995.
2. Gerth Stølting Brodal. Worst-case efficient priority queues. In Proc. 7th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 52-58, 1996.
3. Danny Z. Chen and Xiaobo Hu. Fast and efficient operations on parallel priority queues (preliminary version). In Algorithms and Computation: 5th International Symposium, ISAAC’93, volume 834 of Lecture Notes in Computer Science, pages 279-287. Springer Verlag, Berlin, 1994.
4. Paul F. Dietz. Heap construction in the parallel comparison tree model. In Proc. 3rd Scandinavian Workshop on Algorithm Theory (SWAT), volume 621 of Lecture Notes in Computer Science, pages 140-150. Springer Verlag, Berlin, 1992.
5. Paul F. Dietz and Rajeev Raman. Very fast optimal parallel algorithms for heap construction. In Proc. 6th Symposium on Parallel and Distributed Processing, pages 514-521, 1994.
6. James R. Driscoll, Harold N. Gabow, Ruth Shrairman, and Robert E. Tarjan. Relaxed heaps: An alternative to fibonacci heaps with applications to parallel computation. Communications of the ACM, 31(11):1343-1354, 1988.
7. Robert W. Floyd. Algorithm 245: Treesort3. Communications of the ACM, 7(12):701, 1964.
8. Michael L. Fredman, Robert Sedgewick, Daniel D. Sleator, and Robert E. Tarjan. The pairing heap: A new form of self-adjusting heap. Algorithmica, 1:111-129, 1986.
9. Michael L. Fredman and Robert Endre Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. In Proc. 25rd Ann. Symp. on Foundations of Computer Science (FOCS), pages 338-346, 1984.
10. Joseph JáJá. An Introduction to Parallel Algorithms. Addison-Wesley, 1992.
11. C. M. Khoong. Optimal parallel construction of heaps. Information Processing Letters, 48:159-161, 1993.
12. F. Thomson Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.
13. Kurt Mehlhom and Athanasios K. Tsakalidis. Data structures. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity. MIT Press/Elsevier, 1990.
14. Maria Cristina Pinotti, Sajal K. Das, and Vincenzo A. Crupi. Parallel and distributed meldable priority queues based on binomial heaps. In Int. Conference on Parallel Processing, 1996.
15. Maria Cristina Pinotti and Geppino Pucci. Parallel priority queues. Information Processing Letters, 40:33-40, 1991.
16. Maria Cristina Pinotti and Geppino Pucci. Parallel algorithms for priority queue operations. In Proc. 3rd Scandinavian Workshop on Algorithm Theory (SWAT), volume 621 of Lecture Notes in Computer Science, pages 130-139. Springer Verlag, Berlin, 1992.
17. A. Ranade, S. Cheng, E. Deprit, J. Jones, and S. Shih. Parallelism and locality in priority queues. In Proc. 6th Symposium on Parallel and Distributed Processing, pages 490-496, 1994.
18. Nageswara S. V. Rao and Weixiong Zhang. Building heaps in parallel. Information Processing Letters, 37:355-358, 1991.
19. Jean Vuillemin. A data structure for manipulating priority queues. Communications of the ACM, 21(4):309-315, 1978.
20. J. W. J. Williams. Algorithm 232: Heapsort. Communications of the ACM, 7(6):347-348, 1964.