Modeling Locality: A Probabilistic Analysis of LRU and FWF

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

Volumn 3221, Issue , 2004, Pages 98-109

  Becchetti, Luca ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

COMPETITIVE ANALYSIS; COMPETITIVE RATIO; LOCALITY OF REFERENCE; PAGING ALGORITHMS; PRACTICAL EXPERIENCE; PROBABILISTIC ANALYSIS;

ALGORITHMS;

EID: 35048844180     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30140-0_11     Document Type: Article

References (22)

1. S. Albers, L. M. Favrholdt, and O. Giel. On paging with locality of reference. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC-02), pages 258-267, 2002.
2. L. A. Belady. A study of replacement algorithms for a virtual-storage computer. IBM Systems Journal, 5(2):78-101, 1966.
3. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
4. 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.
5. J. Boyar, L. M. Favrholdt, and K. S. Larsen. The relative worst case order ratio applied to paging. In Proceedings of the 5th Italian Conference on Algorithms and Complexity, pages 58-69, 2003.
6. J. Boyar, L. M. Favrholdt, and K. S. Larsen. The relative worst order ratio applied to paging. Tech. report ALCOMFT-TR-03-32, Future and Emerging Technologies program under the EU, contract number IST-1999-14186, 2003.
7. P. J. Denning. The working set model for program behaviour. Communications of the ACM, 11(5):323-333, 1968.
8. A. Fiat and A. R. Karlin. Randomized and multipointer paging with locality of reference. In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 626-634, 1995.
9. A. Fiat, R. Karp, M. Luby, L. McGeoch, D. Sleator, and N. E. Young. Competitive paging algorithms. Journal of Algorithms, 12(4):685-699, 1991.
10. A. Fiat and M. Mendel. Truly online paging with locality of reference. In 38th IEEE Annual Symposium on Foundations of Computer Science, pages 326-335, 1997.
11. S. Irani, A. R. Karlin, and S. Phillips. Strongly competitive algorithms for paging with locality of reference. SIAM Journal on Computing, 25(3):477-497, 1996.
12. A. R. Karlin, S. J. Phillips, and P. Raghavan. Markov paging. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 208-217, 1992.
13. E. Koutsoupias and C. H. Papadimitriou. Beyond competitive analysis. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pages 394-400, 1994.
14. M.Chrobak and J. Noga. LRU is better than FIFO. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), pages 78-81, 1998.
15. D. Sleator and R. E. Tarjan. Amortized Efficiency of List Update and Paging Rules. Communications of the ACM, 28:202-208, 1985.
16. Andrew S. Tanenbaum. Modern Operating Systems. Prentice Hall, 1992.
17. E. Torng. A unified analysis of paging and caching. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pages 194-203, 1995.
18. N. Young. The k-server dual and loose competitiveness for paging. Algorithmica, 11(6):525-541, 1994.
19. N. E. Young. On-line file caching. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), pages 82-86, 1998.
20. N. E. Young. On-line paging against adversarially biased random inputs. Journal of Algorithms, 37(1):218-235, 2000.
21. Neal Young. Competitive paging and dual-guided on-line weighted caching and matching algorithms. PhD thesis, Department of Computer Science, Princeton University, 1991.
22. Neal E. Young. Bounding the diffuse adversary. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 420-425, 1998.