Skip to main content
SpringerLink
Log in

Competitive analysis of paging

  • Chapter
  • First Online:
Online Algorithms

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1442))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Achlioptas, M. Chrobak, and J. Noga. Competitive analysis of randomized paging algorithms. In Proc. 4th European Symposium on Algorithms, LNCS, pages 419–430. Springer, 1996.

    Google Scholar 

  2. S. Albers. The influence of lookahead in competitive paging algorithms. In First Annual European Symposium on Algorithms, pages 1–12, 1993.

    Google Scholar 

  3. H. Alborzi, E. Torng, P. Uthaisombut, and S.Wagner. The k-client problem. In Proc. of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 73–82, 1997.

    Google Scholar 

  4. L.A. Belady. A study of replacement algorithms for virtual storage computers. IBM Systems Journal, 5:78–101, 1966.

    Google Scholar 

  5. S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Widgerson. On the power of randomization in on-line algorithms. In Proc. 22nd Symposium on Theory of Algorithms, pages 379–386, 1990.

    Google Scholar 

  6. A. Borodin, S. Irani, P. Raghavan, and B. Schieber. Competitive paging with locality of reference. In Proc. 23rd ACM Symposium on Theory of Computing, pages 249–259, 1991.

    Google Scholar 

  7. A. Borodin, N. Linial, and M. Saks. An optimal online algorithm for metrical task systems. In Proc. 19th Annual ACM Symposium on Theory of Computing, pages 373–382, 1987.

    Google Scholar 

  8. D. Breslauer. On competitive on-line paging with lookahead. In 13th Annual Symposium on Theoretical Aspects of Computer Science., pages 593–603, 1996.

    Google Scholar 

  9. P. Cao and S. Irani. Cost-aware WWW proxy caching algorithms. Technical report, 1343, Dept. of Computer Sciences, University of Wisconsin-Madison, May 1997. A shorter version appears in the 2nd Web Caching Workshop, Boulder, Colorado, June 1997.

    Google Scholar 

  10. M. Chrobak, H. Karloff, T. H. Payne, and S. Vishwanathan. New results on server problems. SIAM Journal on Discrete Mathematics, 4:172–181, 1991. Also in Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 1990, pp. 291–300.

    Article  Google Scholar 

  11. M. Chrobak and J. Noga. LRU is better than FIFO. In Proc. of 9th ACM-SIAM Symposium on Discrete Algorithms, pages 78–81, 1998.

    Google Scholar 

  12. W. Feller. An introduction to probability theory and its applications. John Wiley and Sons, 1950.

    Google Scholar 

  13. E. Feuerstein. On-line pagine of Structured Data and Multi-threaded Paging. PhD thesis, University of Rome, 1995.

    Google Scholar 

  14. A. Fiat, R. Karp, M. Luby, L. A. McGeoch, D. Sleator, and N.E. Young. Competitive paging algorithms. Journal of Algorithms, 12:685–699, 1991.

    Article  Google Scholar 

  15. A. Fiat and M. Mendel. Truly online paging with locality of reference. In Proc. for the 38th Annual Symposium on Foundations of Computer Science, pages 326–335, 1997.

    Google Scholar 

  16. A. Fiat and Z. Rosen. Experimental studies of access graph based heuristics: Beating the LRU standard? In Proc. of 8th ACM-SIAM Symposium on Discrete Algorithms, pages 63–72, 1997.

    Google Scholar 

  17. S. Irani. Page replacement with multi-size pages and applications to web caching. In Proc. 29th ACM Symposium on the Theory of Computing, pages 701–710, 1997.

    Google Scholar 

  18. S. Irani, A. Karlin, and S. Phillips. Strongly competitive algorithms for paging with locality of reference. In 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 228–236, 1992.

    Google Scholar 

  19. A. Karlin, M. Manasse, L. Rudolph, and D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):79–119, 1988.

    Article  MathSciNet  Google Scholar 

  20. A. Karlin, S. Phillips, and P. Raghavan. Markov paging. In Proc. 33rd IEEE Symposium on Foundations of Computer Science, pages 208–217, 1992.

    Google Scholar 

  21. E. Koutsoupias and C. Papadimitriou. Beyond competitive analysis. In Proc. 25th Symposium on Foundations of Computer Science, pages 394–400, 1994.

    Google Scholar 

  22. C. Lund, S. Phillips, and N. Reingold. Ip over connection-oriented networks and distributional paging. In 35th IEEE Symposium on Foundations of Computer Science, pages 424–435, 1994.

    Google Scholar 

  23. L. McGeoch and D. Sleator. A strongly competitive randomized paging algorithm. J. Algorithms, 6:816–825, 1991.

    Article  Google Scholar 

  24. K. Li P. Cao, E.W. Felten. Application-controlled file caching policies. In Proc. for the Summer USENIX Conference, 1994.

    Google Scholar 

  25. P. Raghavan and M. Snir. Memory versus randomization in online algorithms. In 16th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science vol. 372, pages 687–703. Springer-Verlag, 1989.

    Google Scholar 

  26. J.S. Vitter R.D. Barve, E.F. Grove. Application-controlled paging for a shared cache. In Proc. for the 36th Annual Symposium on Foundations of Computer Science, pages 204–213, 1995.

    Google Scholar 

  27. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202–208, 1985.

    Article  Google Scholar 

  28. E. Torng. A unified analysis of paging and caching. In 36th IEEE Symposium on Foundations of Computer Science, pages 194–203, 1995.

    Google Scholar 

  29. A.C. Yao. Probabilistic computations: Towards a unified measure of complexity. In Proc. 12th ACM Symposium on Theory of Computing, 1980.

    Google Scholar 

  30. N. Young. Dual-guided on-line weighted caching and matching algorithms. Technical Report Tech. Report CS-TR-348-91, Comp. Sci. Dept., Princeton University, 1991.

    Google Scholar 

  31. N. Young. The k-server dual and loose competitiveness for paging. In Proc. of 2nd ACM-SIAM Symposium on Discrete Algorithms, pages 241–250, 1991.

    Google Scholar 

  32. N. Young. Online file caching. In Proc. of 9th ACM-SIAM Symposium on Discrete Algorithms, pages 82–86, 1998.

    Google Scholar 

Download references

Authors
  1. Sandy Irani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Amos Fiat Gerhard J. Woeginger

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Irani, S. (1998). Competitive analysis of paging. In: Fiat, A., Woeginger, G.J. (eds) Online Algorithms. Lecture Notes in Computer Science, vol 1442. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029564

Download citation

  • DOI: https://doi.org/10.1007/BFb0029564

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64917-5

  • Online ISBN: 978-3-540-68311-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation