- A Theoretical Comparison of LRU and LRU-K.
- Joan Boyar, Martin R. Ehmsen, Jens S. Kohrt, and Kim S. Larsen.
Acta Informatica, 47(7-8): 359-374, 2010.
The paging algorithm Least Recently Used Second Last Request
(LRU-2) was proposed for use in
database disk buffering and shown experimentally to perform better than
Least Recently Used (LRU). 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
for cache size k
which is worse than LRU's competitive ratio of
. However, using relative worst order analysis, we show that LRU-2 and
LRU are comparable in LRU-2's favor, giving a theoretical justification
for the experimental results. Many of our results for LRU-2 also apply to
its generalization, Least Recently Used K
th Last Request.
- Link to the publication at the publisher's site - subscription may be required.
Text required by the publisher (if any):
The final publication is available at link.springer.com.
open access (120 KB)
The same as the publisher's version, when the publisher permits. Otherwise, the author's last version before the publisher's copyright; this is often exactly the same, but sometimes fonts, page numbers, figure numbers, etc. are different. It may also be a full version. However, it is safe to read this version, and at the same time cite the official version, as long as references to concrete locations, numbered theorems, etc. inside the article are avoided.
Other publications by the author.