Duality between prefetching and queued writing with parallel disks

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

Volumn 2161, Issue , 2001, Pages 62-73

  Hutchinson, David A ^a   Sanders, Peter ^b   Vitter, Jeffrey Scott ^a  

^a Duke University   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS;

CACHING AND PREFETCHING; COST-EFFECTIVE MEANS; HIGH BANDWIDTH; LINEAR-TIME ALGORITHMS; LOWER ORDER TERMS; MASSIVE DATA SETS; OPTIMAL SCHEDULE; SORTING ALGORITHM;

COST EFFECTIVENESS;

EID: 84943233943     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44676-1_5     Document Type: Conference Paper

References (19)

1. A. Aggarwal and J. S. Vitter. The Input/Output complexity of sorting and related problems. Communications of the ACM, 31(9):1116-1127, 1988.
2. S. Albers, N. Garg, and S. Leonardi. Minimizing stall time in single and parallel disk systems. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), pages, 454-462, New York, May 23-26 1998. ACM Press.
3. R. D. Barve and J. S. Vitter. A simple and effcient parallel disk mergesort. In Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures, pages, 232-241, St. Malo, France, June 1999.
4. Rakesh D. Barve, Edward F. Grove, and Jeffrey Scott Vitter. Simple randomized mergesort on parallel disks. Parallel Computing, 23(4):601-631, 1997.
5. A. L. Belady. A study of replacement algorithms for virtual storage computers. IBM Systems Journal, 5:78-101, 1966.
6. Allan Borodin and Ran El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, Cambridge, 1998.
7. Pei Cao, Edward W. Felten, Anna R. Karlin, and Kai Li. Implementation and performance of integrated application-controlled file caching, prefetching and disk scheduling. ACM Transactions on Computer Systems, 14(4):311-343, Nov. 1996
8. F. Dehne, W. Dittrich, and D. Hutchinson. Efficient external memory algorithms by simulating coarse-grained parallel algorithms. In Proceedings of the 9th ACM Symposium on Parallel Algorithms and Architectures, pages, 106-115, June 1997.
9. F. Dehne, D. Hutchinson, and A. Maheshwari. Reducing I/O complexity by simulating coarse grained parallel algorithms. In Proc. of the Intl. Parallel Processing Symmposium, pages, 14-20, April 1999.
10. M. Kallahalla and P. J. Varman. Optimal read-once parallel disk scheduling. In IOPADS, pages, 68-77, 1999.
11. M. Kallahalla and P.J. Varman. Optimal prefetching and caching for parallel I/O systems. In Proc. of the ACM Symposium on Parallel Algorithms and Architectures, 2001. To appear.
12. Tracy Kimbrel and Anna R. Karlin. Near-optimal parallel prefetching and caching. SIAM Journal on Computing, 29(4):1051-1082, 2000.
13. D. E. Knuth. The Art of Computer Programming | Sorting and Searching, volume 3. Addison Wesley, 2nd edition, 1998.
14. M. H. Nodine and J. S. Vitter. Deterministic distribution sort in shared and distributed memory multiprocessors. In Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pages, 120-129, Velen, Germany, June-July 1993.
15. M. H. Nodine and J. S. Vitter. Greed Sort: An optimal sorting algorithm for multiple disks. Journal of the ACM, 42(4):919-933, July 1995.
16. P. Sanders, S. Egner, and J. Korst. Fast concurrent access to parallel disks. In 11th ACM-SIAM Symposium on Discrete Algorithms, pages, 849-858, 2000.
17. J. S. Vitter. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys, in press. An earlier version entitled "External Memory Algorithms and Data Structures" appeared in External Memory Algorithms and Visualization, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, 1999, 1-38.
18. J. S. Vitter and D. A. Hutchinson. Distribution sort with randomized cycling. In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, Washington, January 2001.
19. J. S. Vitter and E. A. M. Shriver. Algorithms for parallel memory I: Two-level memories. Algorithmica, 12(2-3):110-147, 1994.