A short proof of optimality for the MIN cache replacement algorithm

Abstract

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 byMattson, Gecsei, Slutz, and Traiger [2] through a lengthy analysis. We provide a short and elementary proof based on a dynamic programming argument. 
DOI: 10.1016/j.ipl.2006.11.009

Topics

  • Presentations referencing similar topics