Competitive analysis of the LRFU paging algorithm

Edith Cohen, Haim Kaplan, Uri Zwick

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 +(formula presented) − 1, where 12 ≤ λ ≤ 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.

Original languageEnglish
Title of host publicationAlgorithms and Data Structures - 7th International Workshop, WADS 2001, Proceedings
EditorsFrank Dehne, Jorg-Rudiger Sack, Roberto Tamassia
PublisherSpringer Verlag
Pages148-154
Number of pages7
ISBN (Print)3540424237, 9783540424239
DOIs
StatePublished - 2001
Event7th International Workshop on Algorithms and Data Structures, WADS 2001 - Providence, United States
Duration: 8 Aug 200110 Aug 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2125
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th International Workshop on Algorithms and Data Structures, WADS 2001
Country/TerritoryUnited States
CityProvidence
Period8/08/0110/08/01

Fingerprint

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

Cite this