Selection algorithms for parallel disk systems

Proceedings - Symposium on Computer Architecture and High Performance Computing

Volumn , Issue , 1998, Pages 343-350

  Rajasekaran, S ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; COMPUTERS;

ASYMPTOTICALLY OPTIMAL; PARALLEL DISK SYSTEMS; PROCESSOR SPEED; RANDOMIZED SELECTION; SELECTION ALGORITHM; TIME BOUND;

COMPUTER SCIENCE;

EID: 85013588291     PISSN: 15506533     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HIPC.1998.738007     Document Type: Conference Paper

References (20)

1. D. Angluin and L. G. Valiant, Fast Proba-bilistic Algorithms for Hamiltonian Paths and Matchings, Journal of Computer and System Sciences 18, 1979, pp. 155-193.
2. S. Chaudhari, T. Hagerup, and R. Raman, Approximate and Exact Deterministic Paral-lel Selection, Proc. 18th Annual Symposium on Mathematical Foundations of Computer Science, 1993.
3. H. Cherno, A Measure of Asymptotic E-ciency for Tests of a Hypothesis Based on the Sum of Observations, Annals of Mathematical Statistics 23, 1952, pp. 493-507.
4. A. Aggarwal and C. G. Plaxton, Optimal Parallel Sorting in Multi-Level Storage, Proc. Fifth Annual ACM Symposium on Discrete Algorithms, 1994, pp. 659-668.
5. A. Aggarwal and J. S. Vitter, The In-put/Output Complexity of Sorting and Re-lated Problems, Communications of the ACM, 1988, 31(9):1116-1127.
6. R. Barve, E. F. Grove, and J. S. Vitter, Sim-ple Randomized Mergesort on Parallel Disks, Technical Report CS-1996-15, Department of Computer Science, Duke University, October 1996.
7. M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, R. E. Tarjan, Time Bounds for Selection, Journal of Computer and System Sciences 7, 1973, pp. 448-461.
8. R. Cole, An Optimally Ecient Selection Al-gorithm, Information Processing Letters 26, 1988, pp. 295-299.
9. R. W. Floyd and R. L. Rivest, Expected Time Bounds for Selection, Communications of the ACM 18(3), 1975, pp. 165-172.
10. E. Horowitz, S. Sahni, and S. Rajasekaran, Computer Algorithms, W. H. Freeman Press, 1998.
11. J. J'a Ja, Parallel Algorithms: Design and Analysis, Addison-Wesley Publishers, 1992.
12. J. I. Munro and M. S. Paterson, Selection and Sorting with Limited Storage, Theoret-ical Computer Science 12, 1980, pp. 315-323.
13. M. H. Nodine, J. S. Vitter, Large Scale Sort-ing in Parallel Memories, Proc. Third Annual ACM Symposium on Parallel Algorithms and Architectures, 1990, pp. 29-39.
14. V. S. Pai, A. A. Schaffer, and P. J. Varman, Markov Analysis of Multiple-Disk Prefetching Strategies for External Merging, Theoretical Computer Science, 1994, 128(2):211-239.
15. S. Rajasekaran, A Framework For Simple Sorting Algorithms On Parallel Disk Systems, Proc. 10th Annual ACM Symposium on Par-Allel Algorithms and Architectures, 1998.
16. S. Rajasekaran, Sorting and Selection on In-Terconnection Networks, DIMACS Series in Discrete Mathematics and Theoretical Com-puter Science 21, 1995, pp. 275-296.
17. S. Rajasekaran and J.H. Reif, Derivation of Randomized Sorting and Selection Algo-rithms, in Parallel Algorithm Derivation and Program Transformation, Edited by R. Paige, J.H. Reif, and R. Wachter, Kluwer Academic Publishers, 1993, pp. 187-205.
18. S. Rajasekaran and S. Sen, Random Sampling Techniques and Parallel Algorithms Design, in Synthesis of Parallel Algorithms, edited by J. H. Reif, Morgan-Kaufmann Publishers, 1993, pp. 411-451.
19. R. Reischuk, Probabilistic Parallel Algo-rithms for Sorting and Selection, SIAM Jour-nal of Computing, 1985, 14(2):396-409.
20. J. S. Vitter and E. A. M. Shriver, Algorithms for Parallel Memory I: Two-Level Memories, Algorithmica, 1994, 12(2-3):110-147.