An optimality proof of the LRU- K page replacement algorithm

DOI10.1145/300515.300518zbMath1065.68511OpenAlexW1989725425WikidataQ105870800 ScholiaQ105870800MaRDI QIDQ3158533

Gerhard Weikum, Patrick E. O'Neil, Elizabeth O'Neil

Publication date: 25 January 2005

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/300515.300518

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (3)

A theoretical comparison of LRU and LRU-K ⋮ On the separation and equivalence of paging strategies and other online algorithms ⋮ Policies for data archival in hierarchical storage management

This page was built for publication: An optimality proof of the LRU- K page replacement algorithm