Skip to main content
SpringerLink
Log in
Book cover

European Symposium on Algorithms

ESA 1996: Algorithms — ESA '96 pp 419–430Cite as

Competitive analysis of randomized paging algorithms

  • Conference paper
  • First Online:

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

Abstract

In this paper we use competitive analysis to study the performance of randomized on-line paging algorithms. We present two results: we first show that the competitive ratio of the marking algorithm is exactly 2H k−1. Previously, it was known to be between H k and 2H k . Then we provide a new, H k -competitive algorithm for paging. Our algorithm, as well as its analysis, is simpler than the known algorithm by McGeoch and Sleator. Another advantage of our algorithm is thatit can be implemented with complexity bounds independent of the number of past requests: O(k 2 log k) memory and O(k 2) time per request.

Research supported by an NSERC fellowship.

Research supported by the NSF grant CCR-9503498.

Research supported by the NSF grant CCR-9503498.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. To appear in Journal of Computer and System Sciences.

    Google Scholar 

  2. M. Chrobak and L. L. Larmore. An optimal online algorithm for k servers on trees. SIAM Journal on Computing, 20:144–148, 1991.

    Article  Google Scholar 

  3. M. Chrobak and L. L. Larmore. Metrical service systems: Randomized strategies. manuscript, 1992.

    Google Scholar 

  4. M. Chrobak and L. L. Larmore. Generosity helps or an 11-competitive algorithm for three servers. Journal of Algorithms, 16:234–263, 1994. Also in Proceedings of ACM/SIAM Symposium on Discrete Algorithms, 1992, 196–202.

    Google Scholar 

  5. M. Chrobak, L. L. Larmore, N. Reingold, and J. Westbrook. Page migration algorithms using work functions. Technical Report YALE/DCS/RR-910, Department of Yale University, 1992. Submitted for journal publication.

    Google Scholar 

  6. 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 

  7. 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 

  8. 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 

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

    Google Scholar 

  10. E. Koutsoupias and C. Papadimitriou. On the k-server conjecture. In Proc. 25th Symposium on Theory of Computing, pages 507–511, 1994.

    Google Scholar 

  11. H. Kuhn. Extensive games and the problem of information. In H. Kuhn and A. Tucker, editors, Contributions to the Theory of Games, pages 193–216. Princeton University Press, 1953.

    Google Scholar 

  12. M. Manasse, L. A. McGeoch, and D. Sleator. Competitive algorithms for server problems. Journal of Algorithms, 11:208–230, 1990. Also in Proc. 20th Annual ACM Symposium on Theory of Computing, 1988, pp. 322–333.

    Article  Google Scholar 

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

    Google Scholar 

  14. 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 

  15. 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 

  16. N. Young. The k-server dual and loose competitiveness for paging. Algorithmica, 1991. To appear. Rewritten version of “On-line caching as cache size varies”, in The 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, 241–250, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Toronto, M5S 3G4, Toronto, ON, Canada

    Dimitris Achlioptas

  2. Department of Computer Science, University of California, 92521, Riverside, CA, USA

    Marek Chrobak

  3. Department of Mathematics, University of California, 92521, Riverside, CA, USA

    John Noga

Authors
  1. Dimitris Achlioptas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marek Chrobak
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. John Noga
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Josep Diaz Maria Serna

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Achlioptas, D., Chrobak, M., Noga, J. (1996). Competitive analysis of randomized paging algorithms. In: Diaz, J., Serna, M. (eds) Algorithms — ESA '96. ESA 1996. Lecture Notes in Computer Science, vol 1136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61680-2_72

Download citation

  • DOI: https://doi.org/10.1007/3-540-61680-2_72

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61680-1

  • Online ISBN: 978-3-540-70667-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation