Minimizing stall time in single and parallel disk systems

Journal of the ACM

Volumn 47, Issue 6, 2000, Pages 969-986

  Albers, Susanne ^a   Garg, Naveen ^b   Leonardi, Stefano ^c  

^a TU DORTMUND UNIVERSITY   (Germany)

^b INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Approximation algorithms; Caching algorithms; Prefetching

Indexed keywords

ALGORITHMS; COMPUTER OPERATING SYSTEMS; LINEAR PROGRAMMING; PERFORMANCE; POLYNOMIALS; PROGRAM PROCESSORS;

APPROXIMATION ALGORITHMS; CACHING; PREFETCHING; STALL TIME;

CACHE MEMORY;

EID: 0011857319     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/355541.355542     Document Type: Article

References (22)

1. BELADY, L. A. 1966. A study of replacement algorithms for virtual storage computers. IBM Syst. J. 5, 78-101.
2. BORODIN, A., IRANI, S., RAGHAVAN, P., AND SCHIEBER, B. 1995. Competitive paging with locality of reference. J. Comput. Syst. Sei. 50, 244-258.
3. CAO, P., FELTEN, E. W., KARLIN, A. R., AND Li, K. 1995. A study of integrated prefetching and caching strategies. In Proceedings of the Joint ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS '95/PERFORMANCE '95) (Ottawa, Ont., Canada, May 15-19). ACM, New York, 188-196.
4. CAO, P., FELTEN, E. W., KARLIN, A. R., AND Li, K. 1996. Implementation and performance of integrated application-controlled caching, Prefetching and disk scheduling. ACM Trans. Comput. Syst. (TOCS) 14, 4 (Nov.), 311-343.
5. CUREWITZ, K. M., KRISHNAN, P., AND VITTER, J. S. 1993. Practical prefetching via data compression. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (Washington, D.C., May 26-28). ACM, New York, pp. 257-266.
6. ELUS, C. S., AND KOTZ, D. 1989. Prefetching in file systems for MIMD multiprocessors. In Proceedings of the 1989 International Conference on Parallel Processing, pp. 1306-314.
7. FIAT, A., KARP, R. M., McGEOCH, L. A., SLEATOR, D. D., YOUNG, N. E. 1991. Competitive paging algorithms, y. Algorithms 12, 685-699.
8. FIAT, A., KARLIN, A. R. 1995. Randomized and multiprocessor paging with locality of reference. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing (Las Vegas, Nev., May 29-June 1), ACM, New York, pp. 626-634.
9. FIAT, A., ROSEN, Z. 1997. Experimental studies of access graph based heuristics. Beating the LRU standard. In Proceedings of the 8thACM-SIAM Symposium on Discrete Algorithms, ACM, New York, pp. 63-72.
10. FUCHS, D. R., KNUTH, D. E. 1985. Optimal prepaging and font caching. ACM Trans. Prog. Lang. Syst. 7, 62-79.
11. KARLIN, A. R., PHILLIPS, S., RAGHAVAN, P. 1992. Markov paging. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 208-217.
12. KIMBREL, T. 1997. Parallel prefetching and caching (Ph.D. dissertation). Tech. rep. 97-07-03. Dept. Comput. Sei. Eng., Univ. Washington.
13. KIMBREL, T., TOMKINS, A., PATTERSON, R. H., BERSHAD, B., CAO, P., FELTEN, E. W., GIBSON, G. A., KARLIN, A. R., Li, K. 1996. A Trace-Driven Comparison of Algorithms for Parallel Prefetching and Caching. In Proceedings of the ACM SIGOPS/USENIX Association Symposium on Operating System Design and Implementation (OSDI) ACM, New York, 19-34.
14. KIMBREL, T., KARLIN, A. R. 1996. Near-optimal parallel prefetching and caching. In Proceedings of the 37th IEEE Annual Symposium on Foundations of Computer Science. IEEE Computer Science Press, Los Alamitos, Calif., pp. 540-549.
15. KOTZ, D., ELLIS, C. S. 1993. Practical prefetching techniques for multiprocessor file systems. J. Dist. Paral. Datab. 1, 33-51.
16. KRISHNAN, P., VITTER, J. S. 1994. Optimal prediction for prefetching in the worst case. In Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms (Arlington, Va., Jan. 23-25). ACM, New York, pp. 392-401.
17. LEE, K.-K., VARMAN, P. 1995. Prefetching and I/O parallelism in multiple disk systems. In Proceedings of the 1995 International Conference on Parallel Processing. CRC Press, Boca Raton, Fla., pp. III160-163.
18. PALMER, M., ZDONIK, S. B. 1991. Fido: A cache that learns to fetch. In Proceedings of the 17th International Conference on Very Large Data Bases. Morgan-Kaufmann, San Francisco, Calif., pp. 255-264.
19. PATTERSON, R. H., GIBSON, G. A., GINTING, E., STODOLSKY, D., ZELENKA, J. 1995. Informed prefetching and caching. In Proceedings of the 15th Symposium on Operating Systems Principles. (Copper Mountain Resort, Colo., Dec. 3-6). ACM, New York, pp. 79-95.
20. SCHRIJVER, A. 1986. Linear and Integer Programming. Wiley, Chichester, England.
21. SLEATOR, D. D., TARJAN, R. E. 1985. Amortized efficiency of list update and paging rules. Commun. ACM 28, 2 (Feb.), 202-208.
22. VITTER, J., KRISHNAN, P. 1991. Optimal prefetching via data compression. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 121-130.