A short proof of optimality for the MIN cache replacement algorithm

DOI10.1016/j.ipl.2006.11.009zbMath1184.68192OpenAlexW1963831729MaRDI QIDQ845965

Benjamin van Roy

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.11.009

zbMATH Keywords

analysis of algorithmson-line algorithmspagingcaching

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Dynamic programming (90C39) Theory of software (68N99)

Related Items (4)

A simple proof of optimality for the MIN cache replacement policy ⋮ Finding optimal non-datapath caching strategies via network flow ⋮ Flexible resource allocation to interval jobs ⋮ Another short proof of optimality for the MIN cache replacement algorithm

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: A short proof of optimality for the MIN cache replacement algorithm