A unified analysis of paging and caching

Algorithmica (New York)

Volumn 20, Issue 2, 1998, Pages 175-200

  Torng, E ^a  

^a Michigan State University   (United States)

Author keywords

Cache associativity; Caching; Competitive analysis; Locality of reference; Memory access time; Miss penalty; Miss rate; Page size; Paging

Indexed keywords

EID: 0000094273     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009192     Document Type: Article

References (23)

1. A. Aggarwal, B. Alpern, A. Chandra, and M. Snir. A model for hierarchical memory. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 305-314, 1987.
2. A. Aggarwal and A. Chandra. Virtual memory algorithms. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 173-185, 1988.
3. A. Aggarwal, A. Chandra, and M. Snir. Hierarchical memory with block transfer. In Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, pages 204-216, 1987.
4. S. Albers. The influence of lookahead in competitive paging algorithms. In Proceedings of the 1st Annual European Symposium on Algorithms, pages 1-12, 1993.
5. L.A. Belady. A study of replacement algorithms for virtual storage computers. IBM Systems Journal, 5:78-101, 1966.
6. A. Borodin, S. Irani, P. Raghavan, and B. Schieber. Competitive paging with locality of reference. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pages 249-259, 1991.
7. P.J. Denning. The working set model for program behavior. Communications of the ACM, 11(5):323-333, 1968.
8. P.J. Denning. Working sets past and present. IEEE Transactions on Software Engineering, 6:64-84, 1980.
9. A. Fiat and A. Karlin. Randomized and multipointer paging with locality of reference. In Proceedings of the 27th Annual ACM Symposium on the Theory of Computing, pages 626-634, 1995.
10. A. Fiat, R. Karp, M. Luby, L. McGeoch, D. Sleator, and N. Young. Competitive paging algorithms. Journal of Algorithms, 12:685-699, 1991.
11. J.L. Hennessy and D.A. Patterson. Computer Architecture: A Quantitative Approach, second edition. Morgan Kaufmann, Los Altos, CA, 1996.
12. S.S. Irani, A.R. Karlin, and S.J. Phillips. Strongly competitive algorithms for paging with locality of reference. In Proceedings of the Third ACM-SIAM Symposium on Discrete Algorithms, pages 228-236, 1992.
13. A.R. Karlin, S.J. Phillips, and P. Raghavan. Markov paging. In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, pages 208-217, 1992.
14. E. Koutsoupias and C. Papadimitriou. Beyond competitive analysis. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, pages 394-400, 1994.
15. C. Lund, S. Phillips, and N. Reingold. IP over connection-oriented networks and distributional paging. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, pages 424-434, 1994.
16. M.S. Manasse, L.A. McGeoch, and D.D. Sleator. Competitive algorithms for server problems. Journal of Algorithms, 11(2):208-230, 1990.
17. L.L. McGeoch and D.D. Sleator. A strongly competitive randomized paging algorithm. Algorithmica, 6:816-825, 1991.
18. P. Raghavan and M. Snir. Memory versus randomization in on-line algorithms. In Proceedings of the 16th International Colloquium on Automata, Languages, and Programming, pages 687-703. Lecture Notes in Computer Science, volume 372. Springer-Verlag, Berlin, July 1989.
19. G.S. Shedler and C. Tung. Locality in page reference strings. SIAM Journal on Computing, 1:218-241, 1972.
20. D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202-208, 1985.
21. E. Torng. A unified analysis of paging and caching. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pages 194-203, 1995.
22. A.C.-C. Yao. Probabilistic computations: towards a unified measure of complexity. In Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science, pages 222-227, 1977.
23. N. Young. The k-server dual and loose competitiveness for paging. Algorithmica, 11:525-541, 1994.