TY - JOUR
T1 - Competitive analysis of the LRFU paging algorithm
AU - Cohen, E.
AU - Kaplan, H.
AU - Zwick, U.
PY - 2002
Y1 - 2002
N2 - 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.
AB - 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.
KW - Competitive analysis
KW - Paging algorithms
UR - http://www.scopus.com/inward/record.url?scp=0141888132&partnerID=8YFLogxK
U2 - 10.1007/s00453-002-0936-y
DO - 10.1007/s00453-002-0936-y
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0141888132
SN - 0178-4617
VL - 33
SP - 511
EP - 516
JO - Algorithmica
JF - Algorithmica
IS - 4
ER -