Competitive analysis of the LRFU paging algorithm

E. Cohen*, H. Kaplan, U. Zwick

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

Abstract

We present a competitive analysis of the LRFU paging algorithm, a hybrid of the LRU (Least Recently Used) and LFU (Least Frequently Used) paging algorithms. We show that the competitive ratio of LRFU is k + [log(1 - λ)/log λ] - 1, where 1/2 ≤ ≤ ≤ 1 is the decay parameter used by the LRFU algorithm, and k is the size of the cache. This supplies, in particular, the first natural paging algorithms that are competitive but are not optimally competitive, answering a question of Borodin and El-Yaniv. Although LRFU, as it turns out, is not optimally competitive, it is expected to behave well in practice, as it combines the benefits of both LRU and LFU.

Original languageEnglish
Pages (from-to)511-516
Number of pages6
JournalAlgorithmica
Volume33
Issue number4
DOIs
StatePublished - 2002

Keywords

  • Competitive analysis
  • Paging algorithms

Fingerprint

Dive into the research topics of 'Competitive analysis of the LRFU paging algorithm'. Together they form a unique fingerprint.

Cite this