A simple proof of optimality for the MIN cache replacement policy - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Information Processing Letters Year : 2015

A simple proof of optimality for the MIN cache replacement policy

Pierre Michaud
  • Function : Author
  • PersonId : 738135
  • IdHAL : pmichaud

Abstract

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.
Fichier principal
Vignette du fichier
halversion.pdf (259.75 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01199424 , version 1 (14-10-2015)

Identifiers

Cite

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⟩
270 View
809 Download

Altmetric

Share

Gmail Facebook X LinkedIn More