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.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cohen, ., Kaplan, . & Zwick, . Competitive Analysis of the LRFU Paging Algorithm . Algorithmica 33, 511–516 (2002). https://doi.org/10.1007/s00453-002-0936-y
Issue Date:
DOI: https://doi.org/10.1007/s00453-002-0936-y