Competitive analysis of the LRFU paging algorithm

Edith Cohen; Haim Kaplan; Uri Zwick

doi:10.1007/3-540-44634-6_14

Competitive analysis of the LRFU paging algorithm

Edith Cohen, Haim Kaplan, Uri Zwick

School of Computer Science

AT&T

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Algorithms and Data Structures - 7th International Workshop, WADS 2001, Proceedings
Editors	Frank Dehne, Jorg-Rudiger Sack, Roberto Tamassia
Publisher	Springer Verlag
Pages	148-154
Number of pages	7
ISBN (Print)	3540424237, 9783540424239
DOIs	https://doi.org/10.1007/3-540-44634-6_14
State	Published - 2001
Event	7th International Workshop on Algorithms and Data Structures, WADS 2001 - Providence, United States Duration: 8 Aug 2001 → 10 Aug 2001

Publication series

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

Conference

Conference	7th International Workshop on Algorithms and Data Structures, WADS 2001
Country/Territory	United States
City	Providence
Period	8/08/01 → 10/08/01

Access to Document

10.1007/3-540-44634-6_14

Cite this

Cohen, E., Kaplan, H., & Zwick, U. (2001). Competitive analysis of the LRFU paging algorithm. In F. Dehne, J.-R. Sack, & R. Tamassia (Eds.), Algorithms and Data Structures - 7th International Workshop, WADS 2001, Proceedings (pp. 148-154). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2125). Springer Verlag. https://doi.org/10.1007/3-540-44634-6_14

Cohen, Edith ; Kaplan, Haim ; Zwick, Uri. / Competitive analysis of the LRFU paging algorithm. Algorithms and Data Structures - 7th International Workshop, WADS 2001, Proceedings. editor / Frank Dehne ; Jorg-Rudiger Sack ; Roberto Tamassia. Springer Verlag, 2001. pp. 148-154 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{75d0b9d0603446e997a7442d81caf37a,

title = "Competitive analysis of the LRFU paging algorithm",

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.",

author = "Edith Cohen and Haim Kaplan and Uri Zwick",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 7th International Workshop on Algorithms and Data Structures, WADS 2001 ; Conference date: 08-08-2001 Through 10-08-2001",

year = "2001",

doi = "10.1007/3-540-44634-6_14",

language = "אנגלית",

isbn = "3540424237",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "148--154",

editor = "Frank Dehne and Jorg-Rudiger Sack and Roberto Tamassia",

booktitle = "Algorithms and Data Structures - 7th International Workshop, WADS 2001, Proceedings",

address = "גרמניה",

}

Cohen, E, Kaplan, H & Zwick, U 2001, Competitive analysis of the LRFU paging algorithm. in F Dehne, J-R Sack & R Tamassia (eds), Algorithms and Data Structures - 7th International Workshop, WADS 2001, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2125, Springer Verlag, pp. 148-154, 7th International Workshop on Algorithms and Data Structures, WADS 2001, Providence, United States, 8/08/01. https://doi.org/10.1007/3-540-44634-6_14

Competitive analysis of the LRFU paging algorithm. / Cohen, Edith; Kaplan, Haim ; Zwick, Uri.
Algorithms and Data Structures - 7th International Workshop, WADS 2001, Proceedings. ed. / Frank Dehne; Jorg-Rudiger Sack; Roberto Tamassia. Springer Verlag, 2001. p. 148-154 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2125).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Competitive analysis of the LRFU paging algorithm

AU - Cohen, Edith

AU - Kaplan, Haim

AU - Zwick, Uri

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2001.

PY - 2001

Y1 - 2001

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 +(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.

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 +(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.

UR - http://www.scopus.com/inward/record.url?scp=84958046550&partnerID=8YFLogxK

U2 - 10.1007/3-540-44634-6_14

DO - 10.1007/3-540-44634-6_14

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84958046550

SN - 3540424237

SN - 9783540424239

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 148

EP - 154

BT - Algorithms and Data Structures - 7th International Workshop, WADS 2001, Proceedings

A2 - Dehne, Frank

A2 - Sack, Jorg-Rudiger

A2 - Tamassia, Roberto

PB - Springer Verlag

T2 - 7th International Workshop on Algorithms and Data Structures, WADS 2001

Y2 - 8 August 2001 through 10 August 2001

ER -

Cohen E, Kaplan H , Zwick U. Competitive analysis of the LRFU paging algorithm. In Dehne F, Sack JR, Tamassia R, editors, Algorithms and Data Structures - 7th International Workshop, WADS 2001, Proceedings. Springer Verlag. 2001. p. 148-154. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-44634-6_14

Competitive analysis of the LRFU paging algorithm

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this