Theoretical evidence for the superiority of LRU-2 over LRU for the paging problem

Authors:
Joan Boyar;Martin R. Ehmsen;Kim S. Larsen
Affiliations:
Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark;Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark;Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark
Venue:
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Year:
2006

Citing 8
Cited 8

Amortized efficiency of list update and paging rules

Communications of the ACM
The LRU-K page replacement algorithm for database disk buffering

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Competitive paging with locality of reference

Selected papers of the 23rd annual ACM symposium on Theory of computing
Online computation and competitive analysis

Online computation and competitive analysis
Experimental studies of access graph based heuristics: beating the LRU standard?

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Online Bin Coloring

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
The relative worst order ratio applied to paging

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The relative worst order ratio for on-line algorithms

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity

Paging and list update under bijective analysis

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On the relative dominance of paging algorithms

Theoretical Computer Science
Comparing First-Fit and Next-Fit for online edge coloring

Theoretical Computer Science
On the relative dominance of paging algorithms

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Comparing online algorithms for bin packing problems

Journal of Scheduling
Parameterized analysis of paging and list update algorithms

WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
A new variable-sized bin packing problem

Journal of Scheduling
Paging and list update under bijective analysis

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paging algorithm LRU-2 was proposed for use in data-base disk buffering and shown experimentally to perform better than LRU [O'Neil, O'Neil, and Weikum, 1993]. We compare LRU-2 and LRU theoretically, using both the standard competitive analysis and the newer relative worst order analysis. The competitive ratio for LRU-2 is shown to be 2k for cache size k, which is worse than LRU's competitive ratio of k. However, using relative worst order analysis, we show that LRU-2 and LRU are asymptotically comparable in LRU-2's favor, giving a theoretical justification for the experimental results.