A short proof of optimality for the MIN cache replacement algorithm

The MIN algorithm is an offline strategy for deciding which item to replace when writing a new item to a cache. Its optimality was first established by Mattson, Gecsei, Slutz, and Traiger [2] through a lengthy analysis. We provide a short and elementary proof based on a dynamic programming argument.

• Type: Journal
• Year: 2007
• Where: IPL
• Authors: Benjamin Van Roy
• Keywords: Dynamic Programming Argument, IPL 2007, Min Algorithm, Offline Strategy