A simple proof of optimality for the MIN cache replacement policy

DOI10.1016/J.IPL.2015.09.004zbMATH Open1347.68379OpenAlexW1647086036MaRDI QIDQ894469FDOQ894469

Mun-Kyu Lee, DaeHun Nyang, J. S. 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

Recommendations

• A short proof of optimality for the MIN cache replacement algorithm
• Another short proof of optimality for the MIN cache replacement algorithm
• A proof of the optimality of the MIN paging algorithm using linear programming duality
• An optimality proof of the LRU- K page replacement algorithm
• scientific article; zbMATH DE number 1305389

zbMATH Keywords

analysis of algorithmspagingcachingMIN algorithm

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• A proof of the optimality of the MIN paging algorithm using linear programming duality
• An optimality proof of the LRU- K page replacement algorithm
• A short proof of optimality for the MIN cache replacement algorithm
• Another short proof of optimality for the MIN cache replacement algorithm
• Minimizing I/Os in Out-of-Core Task Tree Scheduling

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894469)