Efficient selection algorithms on distributed memory computers

Proceedings of the International Conference on Supercomputing

Volumn 1998-November, Issue , 1998, Pages

  Saukas, E L G ^a   Song, S W ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Coarse grained multicomputer; Parallel algorithm; Selection problem; Simultaneous selection; Sorting

Indexed keywords

MEMORY ARCHITECTURE; PARALLEL ALGORITHMS; SORTING;

COARSE-GRAINED MULTICOMPUTERS; COMMUNICATION ROUNDS; COMPUTING TIME; DISTRIBUTED-MEMORY COMPUTERS; INPUT SEQUENCE; LOCAL MEMORY; SELECTION ALGORITHM; SELECTION PROBLEMS; SIMULTANEOUS SELECTION; SORTING ALGORITHM;

DATA TRANSFER;

EID: 85074182798     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SC.1998.10054     Document Type: Conference Paper

References (17)

1. J. A. Bader, J. JáJá. Practical parallel algorithms for dynamic data redistribution, median finding, and selection. Proc. 10th International Parallel Processing Symposium (1996) 292-301.
2. M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, R. E. Tarjan. Bounds for selection. Journal of Computer and System Sciences 7 (1973) 448-461.
3. E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, S. W. Song. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. Proceedings ICALP'97 - 24th International Colloquium on Automata, Languages, and Programming, P. Degano, R. Gorrieri, A. Marchetti-Spaccamela (editors). Lecture Notes in Computer Science (1997) 390-400.
4. S. Chaudhuri, T. Hagerup, R. Raman. Approximate and exact deterministic parallel selection. Proc. 18th International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science 711 (1993) 352-361.
5. R. J. Cole. Parallel merge sort. SIAM Journal on Computing 17 (1988) 770-785.
6. R. J. Cole. An optimally efficient selection algorithm. Information Processing Letters 26 (1988) 295-299.
7. R. J. Cole, U. Vishkin. Deterministic coin tossing and accelerated cascades: micro and macro techniques for designing parallel algorithms. Proc. 18th Annual ACM Symposium on the Theory of Computing (1986) 206-219.
8. T. H. Cormen, C. E. Leiserson, R. L. Rivest. Introduction to Algorithms. MIT Press (1990).
9. F. Dehne, A. Fabri, A. Rau-Chaplin. Scalable parallel geometric algorithms for coarse grained multicomputers. Proc. ACM 9th Annual Computational Geometry (1993) 298-307.
10. F. Dehne, A. Fabri, C. Kenyon. Scalable and architecture independent parallel geometric algorithms with high probability optimal time. Proc. 6th IEEE Symposium on Parallel and Distributed Processing (1994) 586-593.
11. F. Dehne, X. Deng, P. Dymond, A. Fabri, A. A. Kokhar. A randomized parallel 3D convex hull algorithm for coarse grained multicomputers. Proc. ACM Symposium on Parallel Algorithms and Architectures (SPAA'95) (1995) 27-33.
12. P. F. Dietz, R. Raman. Very fast optimal parallel algorithms for heap construction. Proc. 6th IEEE Symposium on Parallel and Distributed Processing (1994).
13. A. V. Gerbessiotis, C. J. Siniolakis. Deterministic sorting and randomized median finding on the BSP model. Proc. ACM Symposium on Parallel Algorithms and Architectures (1996) 223-232.
14. J. JáJá. An Introduction to Parallel Algorithms. Addison-Wesley (1992).
15. N. Santoro, S. B. Sidney, S. J. Sidney. A distributed selection algorithm and its expected communication complexity. Theoretical Computer Science 100 (1992) 185-204.
16. L. G. Valiant et al. General purpose parallel architectures. Handbook of Theoretical Computer Science, Edited by J. van Leeuwen, MIT Press/Elsevier (1990) 943-972.
17. U. Vishkin. An optimal parallel algorithm for selection. Advances in Computing Research. JAI Press Inc. Greenwich, CT (1987).