PC-OPT: Optimal offline prefetching and caching for parallel I/O systems

IEEE Transactions on Computers

Volumn 51, Issue 11, 2002, Pages 1333-1344

  Kallahalla, Mahesh ^a   Varman, Peter J ^b  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b Rice University   (United States)

Author keywords

Algorithms; Buffer management; Caching; Competitive ratio; Offline algorithm; Online algorithm; Parallel I O systems; Prefetching; Scheduling

Indexed keywords

ALGORITHMS; BANDWIDTH; BUFFER CIRCUITS; PERSONAL COMPUTERS; SCHEDULING;

OFFLINE PREFETCHING;

PARALLEL PROCESSING SYSTEMS;

EID: 0036857008     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2002.1047757     Document Type: Article

References (25)

1. A. Aggarwal and J.S. Vitter, "The Input/Output Complexity of Sorting and Related Problems," Comm. ACM, vol. 31, no. 9, pp. 1116-1127, Sept. 1988.
2. S. Albers, "On the Influence of Lookahead in Competitive Paging Algorithms," Algorithmica, vol. 18, no. 3, pp. 283-305, July 1997.
3. S. Albers, N. Garg, and S. Leonardi, "Minimizing Stall Time in Single and Parallel Disk Systems," J. ACM, vol. 47, no. 6, pp. 969-986, Nov. 2000.
4. D. Askoy and M. Franklin, "Rxw: A Scheduling Approach to Large Scale On-Demand Broadcast," IEEE/ACM Trans. Networking, vol. 7, pp. 846-861, 1999.
5. L.M. Baptist and T.H. Cormen, "Multidimensional, Multiprocessor, Out-of-Core FFTs with Distributed Memory and Parallel Disks," Proc. 11th Ann. ACM Symp. Parallel Algorithms and Architectures, June 1999.
6. R.D. Barve, E.F. Grove, and J.S. Vitter, "Simple Randomized Mergesort on Parallel Disks," Parallel Computing, vol. 23, no. 4, pp. 601-631, June 1996.
7. R.D. Barve, M. Kallahalla, P.J. Varman, and J.S. Vitter, "Competitive Parallel Disk Prefetching and Buffer Management," J. Algorithms, vol. 36, no. 2, pp. 152-181, Aug. 2000.
8. L.A. Belady, "A Study of Replacement Algorithms for a Virtual Storage Computer," IBM Systems J., vol. 5, no. 2, pp. 78-101, 1966.
9. D. Breslauer, "On Competitive On-Line Paging with Lookahead," Proc. 13th Ann. Symp. Theoretical Aspects of Computer Science, pp. 593-603, Feb. 1996.
10. P. Cao, E.W. Felten, A.R. Karlin, and K. Li, "A Study of Integrated Prefetching and Caching Strategies," Proc. Joint Int'l Conf. Measurement and Modeling of Computer Systems, pp. 188-197, May 1995.
11. F. Chang and G.A. Gibson, "Automatic I/O Hint Generation Through Speculative Execution," Operating Systems Design and Implementation (OSDI), pp. 1-14, 1999.
12. T.H. Cormen and M. Hirschl, "Early Experiences in Evaluating the Parallel Disk Model with the VIC* Implementation," Parallel Computing, vol. 23, no. 4, pp. 571-600, 1997.
13. O. Ertug, M. Kallahalla, and P. Varman, "Real-Time Parallel Disk Scheduling for VBR Video Servers," Proc. Fifth Int'l Conf. Computer Science and Informatics, Feb. 2000.
14. A. Fiat, R. Karp, M. Luby, L. McGeoch, D.D. Sleator, and N.E. Young, "Competitive Paging Algorithms," J. Algorithms, vol. 12, no. 4, pp. 685-699, Dec. 1991.
15. M. Kallahalla and P.J. Varman, "Optimal Read-Once Parallel Disk Scheduling," Proc. Sixth ACM Workshop I/O in Parallel and Distributed Systems, pp. 68-77, (see www.ece.rice.edu/pjv for a revised and expanded version), 1999.
16. A.R. Karlin, M.S. Manasse, L. Rudolph, and D.D. Sleator, "Competitive Snoopy Caching," Algorithmica, vol. 5, no. 3, pp. 79-119, Mar. 1988.
17. T. Kimbrel and A.R. Karlin, "Near-Optimal Parallel Prefetching and Caching," SIAM J. Computing, vol. 29, no. 4, pp. 1051-1082, 2000.
18. D.F. Kotz and C.S. Ellis, "Prefetching in File Systems for MIMD Multiprocessors," IEEE Trans. Parallel and Distributed Computing, vol. 1, no. 2, pp. 218-230, 1990.
19. L.A. McGeoch and D.D. Sleator, "A Strongly Competitive Randomized Paging Algorithm," Algorithmica, vol. 6, pp. 816-825, 1991.
20. J.H.M. Korst, P. Sanders, and S. Egner, "Fast Concurrent Access to Parallel Disks," Proc. SIAM Symp. Discrete Algorithms, Jan. 2000.
21. V.S. Pai and A. Schäeffer, and P.J. Varman, "Markov Analysis of Multiple-Disk Prefetching Strategies for External Merging," Theoretical Computer Science, vol. 128, nos. 1-2, pp. 211-239, June 1994.
22. R.H. Patterson, G. Gibson, E. Ginting, D. Stodolsky, and J. Zelenka, "Informed Prefetching and Caching," Proc. 15th ACM Symp. Operating Systems Principles, pp. 79-95, Dec. 1995.
23. D.D. Sleator and R.E. Tarjan, "Amortized Efficiency of List Update and Paging Rules," Comm. ACM, vol. 28, no. 2, pp. 202-208, Feb. 1985.
24. P.J. Varman and R.M. Verma, "Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems," IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 12, pp. 1262-1275, Dec. 1999.
25. J.S. Vitter and E.A.M. Shriver, "Optimal Algorithms for Parallel Memory I: Two-Level Memories," Algorithmica, vol. 12, nos. 2-3, pp. 110-147, 1994.