A simple proof of optimality for the MIN cache replacement policy

DOI10.1016/j.ipl.2015.09.004zbMath1347.68379OpenAlexW1647086036MaRDI QIDQ894469

Mun-Kyu Lee, DaeHun Nyang, Jeong Seop Sim, Pierre Michaud

Publication date: 1 December 2015

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

Full work available at URL: https://hal.inria.fr/hal-01199424/file/halversion.pdf

zbMATH Keywords

analysis of algorithmspagingcachingMIN algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Theory of operating systems (68N25)

Related Items (1)

Minimizing I/Os in Out-of-Core Task Tree Scheduling

Cites Work

• A short proof of optimality for the MIN cache replacement algorithm
• Another short proof of optimality for the MIN cache replacement algorithm

This page was built for publication: A simple proof of optimality for the MIN cache replacement policy