The working set algorithm has competitive ratio less than two

https://doi.org/10.1016/S0020-0190(97)00128-2Get rights and content

Abstract

Denning proposed a variable-space page replacement algorithm called the working set algorithm. The working set algorithm has been studied extensively and its superiority has been demonstrated empirically. Based on competitive analysis, we show that the working set algorithm is the best (strongly competitive) on-line algorithm. We determine the window size that gives the best competitive ratio, which is less than two. We also present a strongly competitive randomized algorithm for variable-space memory management.

References (19)

  • A. Fiat et al.

    Competitive paging algorithms

    J. Algorithms

    (1991)
  • M.S. Manasse et al.

    Competitive algorithms for server problems

    J. Algorithms

    (1990)
  • D. Achlioptas et al.

    Competitive analysis of randomized paging algorithms

  • L.A. Belady

    A study of replacement algorithms for a virtual storage computer

    IBM Syst. J.

    (1970)
  • S. Ben-David et al.

    On the power of randomization in online algorithms

  • A. Borodin et al.

    Competitive paging with locality of reference

  • P.J. Denning

    The working set model for program behavior

    Comm. ACM

    (1968)
  • P.J. Denning

    Working sets past and present

    IEEE Trans. Software Engineering

    (1980)
  • A. Fiat et al.

    Competitive k-server algorithms

There are more references available in the full text version of this article.

Cited by (0)

View full text