A theoretical comparison of LRU and LRU-K

DOI10.1007/s00236-010-0123-6zbMath1214.68128OpenAlexW1987358827MaRDI QIDQ611043

Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen, Joan. Boyar

Publication date: 13 December 2010

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-010-0123-6

zbMATH Keywords

Least Recently Used Second Last Request

Mathematics Subject Classification ID

Database theory (68P15) Theory of operating systems (68N25)

Related Items (4)

Relative Worst-Order Analysis: A Survey ⋮ On the separation and equivalence of paging strategies and other online algorithms ⋮ Stochastic dominance and the bijective ratio of online algorithms ⋮ Parameterized analysis of paging and list update algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• On the relative dominance of paging algorithms
• The relative worst-order ratio applied to paging
• Bincoloring
• Competitive snoopy caching
• Online algorithms: a survey
• Competitive paging with locality of reference
• Separating online scheduling algorithms with the relative worst order ratio
• Comparing online algorithms for bin packing problems
• An optimality proof of the LRU- K page replacement algorithm
• Parameterized Analysis of Paging and List Update Algorithms
• Algorithm Theory - SWAT 2004
• Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem

This page was built for publication: A theoretical comparison of LRU and LRU-K