Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem
From MaRDI portal
Publication:5443512
DOI10.1007/11970125_8zbMath1129.68432OpenAlexW1490670856MaRDI QIDQ5443512
Martin R. Ehmsen, Kim S. Larsen, Joan. Boyar
Publication date: 21 February 2008
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11970125_8
Related Items (7)
On the relative dominance of paging algorithms ⋮ Measuring the problem-relevant information in input ⋮ A theoretical comparison of LRU and LRU-K ⋮ Comparing online algorithms for bin packing problems ⋮ A new variable-sized bin packing problem ⋮ On the Relative Dominance of Paging Algorithms ⋮ Comparing first-fit and next-fit for online edge coloring
This page was built for publication: Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem
