Advertisement

Competitive analysis of randomized paging algorithms

  • Dimitris Achlioptas
  • Marek Chrobak
  • John Noga
Conference paper
Part of the Lecture Notes in Computer Science book series (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 2Hk−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(k2 log k) memory and O(k2) time per request.

Keywords

Work Function Competitive Ratio Online Algorithm Optimal Cost Competitive Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    M. Chrobak and L. L. Larmore. An optimal online algorithm for k servers on trees. SIAM Journal on Computing, 20:144–148, 1991.CrossRefGoogle Scholar
  3. 3.
    M. Chrobak and L. L. Larmore. Metrical service systems: Randomized strategies. manuscript, 1992.Google Scholar
  4. 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. 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. 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.CrossRefGoogle Scholar
  7. 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. 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. 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. 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. 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. 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.CrossRefGoogle Scholar
  13. 13.
    L. McGeoch and D. Sleator. A strongly competitive randomized paging algorithm. J. Algorithms, 6:816–825, 1991.Google Scholar
  14. 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. 15.
    D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202–208, 1985.CrossRefGoogle Scholar
  16. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Dimitris Achlioptas
    • 1
  • Marek Chrobak
    • 2
  • John Noga
    • 3
  1. 1.Department of Computer ScienceUniversity of TorontoTorontoCanada
  2. 2.Department of Computer ScienceUniversity of CaliforniaRiversideUSA
  3. 3.Department of MathematicsUniversity of CaliforniaRiversideUSA

Personalised recommendations