Another short proof of optimality for the MIN cache replacement algorithm

  • Authors:

  • Walter Vogler

  • Affiliations:

  • Institut für Informatik, Universität Augsburg, D-86135 Augsburg, Germany

  • Venue:
  • Information Processing Letters
  • Year:
  • 2008

Quantified Score

Hi-index 0.90

Visualization

Abstract

When a new item is written into a cache, an old item must be evicted; the latter can be chosen by the offline MIN algorithm, which was first proven to be optimal by Mattson et al. [R.L. Mattson, J. Gecsei, D.R. Slutz, I.L. Traiger, Evaluation techniques for storage hierarchies, IBM Systems J. 9 (2) (1970) 78-117]. Recently a new, short proof was given by van Roy [B. van Roy, A short proof of optimality for the MIN cache replacement algorithm, Inform. Process. Lett. 102 (2007) 72-73]; here we give another short proof using what we call an amortized simulation.