Realistic parallel algorithms: Priority queue operations and selection for the BSP* model

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

Volumn 1124, Issue , 1996, Pages 369-376

  Bäumker, Armin ^a   Dittrich, Wolfgang ^a   auf der Heide, Friedhelm Meyer ^a   Rieping, Ingo ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

BUILDING BLOCKES; COMPUTATION TIME; PARALLEL IMPLEMENTATIONS; PARALLEL UPDATE; RANDOMIZED APPROACH; RANDOMIZED SELECTION; SELECTION ALGORITHM; WORK-OPTIMAL ALGORITHM;

ARTIFICIAL INTELLIGENCE;

EID: 4243402623     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0024725     Document Type: Conference Paper

References (14)

1. D. A. Bader, J. Jáá. Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding and Selection. Technical report, Institute for Advanced Computer Studies and Department of Electrical Engineering, University of Maryland, 1995.
2. A. Bäumker, W. Dittrich, F. Meyer auf der Heide, and I. Rieping. Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model. Technical Report University of Paderborn, 1996, http://www.uni-paderborn.de/cs/inri.html.
3. A. Bäumker, W. Dittrich, and F. Meyer auf der Heide. Truly Efficient Parallel Algorithms: c-Optimal Multisearch for an Extension of the BSP model. Proc. of European Symposium on Algorithms, 1995.
4. R. J. Cole. An Optimally Efficient Selection Algorithm. Information Processing Letters, no. 26, pp. 295-299, 1987/88.
5. N. Deo, S. Prasad. Parallel Heap: An Optimal Parallel Priority Queue. Journal of Supercomputing, 1992, vol. 6, no. 1, pp. 87-98, 1992.
6. A. V. Gerbessiotis and C. J. Siniolakis. Deterministic Sorting and Randomized Median Finding on the BSP model. Proc. of the 8th Symposium on Parallel Algorithms and Architectures, 1996.
7. A. V. Gerbessiotis and L. Valiant. Direct Bulk-Synchronous Parallel Algorithms. Journal of Parallel and Distributed Computing, 1994.
8. D. Nassimi and S. Sahni. Parallel Permutation and Sorting Algorithms and a new generalized Connection Network. Journal of the ACM, 29:3, pp. 642-667, 1982.
9. M.C. Pinotti, G. Pucci. Parallel Priority Queues. Information Processing Letters, no. 40, 1991.
10. S. Rajasekaran. Randomized Parallel Selection. Foundations of Software Technology and Theoretical Computer Science, 10: pp. 215-224, 1990.
11. A. Ranade, S. Chang, E. Deprit, J. Jones, and S. Shih. Parallelism and Locality in Priority Queues. Proc. of the 6th IEEE Symp. on Parallel and Distributed Processing (SPDP), IEEE Society Press, 1994.
12. I. Rieping. Realitätsnahe parallele Priority Queues, Analyse und experimentelle Untersuchungen. Diploma Thesis, University of Paderborn, January, 1996.
13. P. Sanders. Fast Priority Queues for Parallel Branch-and-Bound. Workshop on Algorithms for Irregularly Structured Problems, LNCS, Lyon, 1995.
14. R. E. Tarjan. Data Structures and Network Algorithms. Society for Industrial and applied Mathematics, Philadelphia, Pennsylvania, 1983.