Integrated prefetching and caching in single and parallel disk systems

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2003, Pages 109-117

  Albers, Susanne ^a   Büttner, Markus ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Caching; Magnetic disk systems; Prefetching

Indexed keywords

ALGORITHMS; LINEAR PROGRAMMING; POLYNOMIALS;

PARALLEL DISK SYSTEMS;

BUFFER STORAGE;

EID: 0038379380     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777412.777431     Document Type: Conference Paper

References (19)

1. S. Albers, N. Garg and S. Leonardi. Minimizing tall time in single and parallel disk systems. Journal of the ACM, 47:969-986, 2000.
2. S. Albers and C. Witt. Minimizing stall time in single and parallel disk systems using multicommodity network flows. Proc. 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems APPROX), Springer LNCS 2129, 12-23, 2001.
3. L.A. Belady. A study of replacement algorithms for virtual storage computers. IBM Systems Journal, 5:78-101, 1966.
4. A. Borodin, S. Irani, P. Raghavan and B. Schieber. Competitive paging with locality of reference. Journal on Computer and System Sciences, 50:244-258, 1995.
5. P. Cao, E.W. Felten, A.R. Karlin and K. Li. A study of integrated prefetching and caching strategies. Proc. ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), 188-196, 1995.
6. P. Cao, E.W. Felten, A.R. Karlin and K. Li. Implementation and performance of integrated application-controlled caching, prefetching and disk scheduling. ACM Transaction on Computer Systems (TOCS), 14:311-343, 1996.
7. A. Fiat and M. Mendel. Truly online paging with locality of reference. Proc. 38th IEEE Symposium on Foundations of Computer Science, 1997.
8. D.R. Fuchs and D.E. Knuth. Optimal prepaging and font caching. ACM Transactions on Programming Languages and Systems, 7:62-79, 1985.
9. A. Gaysinsky, A. Itai, and H. Shachnai. Strongly competitive algorithms for caching with pipelined prefetching. Proc. 9th Annual European Symposium on Algorithms (ESA01), Springer LNCS 2161, 49-61, 2001.
10. D.A. Hutchinson, P. Sanders, and J.S. Vitter. Duality between prefetching and queued writing with parallel disks. Proc. 9th Annual European Symposium on Algorithms (ESA01), Springer LNCS 2161, 62-73, 2001.
11. M. Kallahalla and P.J. Varman. Optimal prefetching and caching for parallel I/O systems. Proc. 18th ACM Symposium on Parallel Algorithms and Architectures, 2001.
12. T. Kimbrel and A.R. Karlin. Near-optimal parallel prefetching and caching. SIAM Journal on Computing, 29:1051-1082, 2000. Preliminary version in FOCS96.
13. T. Kimbrel, P. Cao, E.W. Felten, A.R. Karlin and K. Li. Integrated parallel prefetching and caching. Proc. ACM International Conference on Measurement and Modeling of Computer Systems (BIOMETRICS), 1996.
14. T. Kimbrel, A. Tomkins, R.H. Patterson, B. Bershad, P. Cao, E.W. Felten, G.A. Gibson, A.R. Karlin and K. Li. A trace-driven comparison of algorithms for parallel prefetching and caching. Proc. of the ACM SIGOPS/USENIX Association Symposium on Operating System Design and Implementation, 1996.
15. P. Krishnan and J.S. Vitter. Optimal prediction for prefetching in the worst case. SIAM Journal on Computing, 27:1617-1636, 1998.
16. M. Palmer and S.B. Zdonik. Fido: A cache that learns to fetch. Proc. 17th International Conference on Very Large Data Bases, 255-264, 1991.
17. R.H. Patterson, G.A. Gibson, E. Ginting, D. Stodolsky and J. Zelenka. Informed prefetching and caching. Proc. 15th Symposium on Operating Systems Principles, 79-95, 1995.
18. D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communication of the ACM, 28:202-208, 1985.
19. J. Vitter and P. Krishnan. Optimal prefetching via data compression. Journal of the ACM, 43:771-793, 1996.