A simple proof of optimality for the MIN cache replacement policy

Mun-Kyu Lee (1) , Pierre Michaud (2) , Jeong Seop Sim (1) , Daehun Nyang (1)

1 Inha University - Incheon
2 ALF - Amdahl's Law is Forever

The MIN cache replacement algorithm is an optimal off-line policy to decide which item to evict when a new item should be fetched into a cache. Recently, two short proofs were given by van Roy and Vogler.. We provide a simpler proof based on a novel invariant condition maintained through an incremental procedure.

Domaines: Architectures Matérielles [cs.AR]

Mun-Kyu Lee, Pierre Michaud, Jeong Seop Sim, Daehun Nyang. A simple proof of optimality for the MIN cache replacement policy. Information Processing Letters, 2015, pp.3. ⟨10.1016/j.ipl.2015.09.004⟩. ⟨hal-01199424⟩