Competitive Analysis of the LRFU Paging Algorithm

Authors:
Edith Cohen;Haim Kaplan;Uri Zwick
Affiliations:
-;-;-
Venue:
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Year:
2001

Citing 6
Cited 0

Page replacement with multi-size pages and applications to Web caching

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Online computation and competitive analysis

Online computation and competitive analysis
On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies

SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On-line file caching

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
LP-based analysis of greedy-dual-size

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Cost-aware WWW proxy caching algorithms

USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems

Quantified Score

Hi-index	0.01

Visualization

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, especially in web applications, as it combines the benefits of both LRU and LFU.