Randomized Priority Queues for Fast Parallel Access

Journal of Parallel and Distributed Computing

Volumn 49, Issue 1, 1998, Pages 86-97

  Sanders, Peter ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Analysis of randomized algorithms; branch and bound; distributed memory; load balancing; median selection; parallel priority queue.

Indexed keywords

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

References (21)

1. Bäumker A., Dittrich W., Meyer auf der Heide F., Rieping I. Realistic parallel algorithms: Priority queue operations and selection for the BSP* model. Europar. Lecture Notes in Computer Science. 1124:1996;Springer-Verlag, Berlin/New York. p. 369-376.
2. Brodal G. S., Träff J. L., Zaroliagis C. D. A parallel priority data structure with applications. J. Parallel Distrib. Comput. 1998.
3. 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.
4. Deo N., Prasad S. Parallel heap. International Conference on Parallel Processing. 1990;. p. 169-172.
5. Driscoll J. R., Gabow H. N., Shrairman R., Tarjan R. E. Relaxed heaps: An alternative to fibonacci heaps with applications to parallel computation. Comm. Assoc. Comput. Mach. 31:1988;1343-1354.
6. Gerbessiotis A. V., Siniolakis C. J. Selection on the bulk-synchronous parallel model with applications to priority queues. International Conference on Parallel and Distributed Processing Techniques and Applications. 1996.
7. Gupta A. K., Phoutiou A. G. Load balanced priority queue implementations on distributed memory parallel machines. Sixth International Conference on Parallel Architectures and Languages Europe. Lecture Notes in Computer Science. 817:1994;Springer-Verlag, Berlin/New York. p. 689-700.
8. Karp R. M., Zhang Y. Parallel algorithms for backtrack search and branch-and-bound. J. Assoc. Comput. Mach. 40:1993;765-789.
9. Knuth D. E. The Art of Computer Programming - Sorting and Searching. 1973;Addison-Wesley, Reading.
10. McColl W. F. Scalable computing. Computer Science Today. Lecture Notes in Computer Science. 1000:1996;Springer-Verlag, Berlin/New York. p. 46-61.
11. Plaxton C. G. On the network complexity of selection. Foundations of Computer Science. 1989;IEEE Press, New York. p. 396-401.
12. Rajasekaran S. Randomized parallel selection. Tenth Conference on Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science. 472:1990;Springer-Verlag, Berlin/New York. p. 215-224.
13. Ranade A. A Simpler Analysis of the Karp-Zhang Parallel Branch-and-bound Method. Technical Report. 1990.
14. Ranade A., Cheng S., Deprit E., Jones J., Shih S. Parallelism and locality in priority queues. Sixth IEEE Symposium on Parallel and Distributed Processing. October 1994;. p. 97-103.
15. Rao V. N., Kumar V. Concurrent access of priority queues. IEEE Trans. Comput. 37:1988;1657-1665.
16. Reischuk R. Probabilistic parallel algorithms for sorting and selection. SIAM J. Comput. 14:1985;396-409.
17. Sanders P. Flaschenhalsfreie parallele priority queues. PARS Workshop. September 1994;PARS Mitteilungen, Potsdam. p. 10-19.
18. Sanders P. Fast priority queues for parallel branch-and-bound. Workshop on Algorithms for Irregularly Structured Problems. Lecture Notes in Computer Science. 980:1995;Springer-Verlag, Berlin/New York. p. 379-393.
19. Sanders P. Randomized Priority Queues for Fast Parallel Access. Technical Report. 1997.
20. Snir M., Otto S. W., Huss-Lederman S., Walker D. W., Dongarra J. MPI - the Complete Reference. 1996;MIT Press, Cambridge.
21. Wattenhofer R., Widmayer P. An inherent bottleneck in distributed counting. J. Parallel Distrib. Computing, 49:1998;135-145.