A short proof of optimality for the MIN cache replacement algorithm

Authors:
Benjamin Van Roy
Affiliations:
Stanford University, Stanford, CA 94305-4023, USA
Venue:
Information Processing Letters
Year:
2007

Citing 3
Cited 4

Randomized algorithms

Randomized algorithms
A study of replacement algorithms for a virtual-storage computer

IBM Systems Journal
Evaluation techniques for storage hierarchies

IBM Systems Journal

Another short proof of optimality for the MIN cache replacement algorithm

Information Processing Letters
Register Spilling and Live-Range Splitting for SSA-Form Programs

CC '09 Proceedings of the 18th International Conference on Compiler Construction: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Towards a predictive cache replacement strategy for multimedia content

Journal of Network and Computer Applications
Overcoming memory limitations in high-throughput event-based applications

Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering

Quantified Score

Hi-index	0.89

Visualization

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 by Mattson et al. [R.L. Mattson, J.Gecsei, D.R. Slutz, I.L. Traiger, Evaluation techniques for storage hierarchies, IBM Systems Journal 9 (2) (1970) 78-117] through a lengthy analysis. We provide a short and elementary proof based on a dynamic programming argument.