A short proof of optimality for the MIN cache replacement algorithm

Information Processing Letters

Volumn 102, Issue 2-3, 2007, Pages 72-73

  Van Roy, Benjamin ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Analysis of algorithms; Caching; On line algorithms; Paging

Indexed keywords

CACHE MEMORY; COMPUTATIONAL METHODS; DECISION THEORY; DYNAMIC PROGRAMMING;

ELEMENTARY PROOF; MIN CACHE REPLACEMENT ALGORITHMS; STORAGE HIERARCHIES;

ALGORITHMS;

EID: 33847268172     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.11.009     Document Type: Article

References (3)

1. Belady L.A. A study of replacement algorithms for virtual storage computers. IBM Systems Journal 5 2 (1966) 78-101
2. Mattson R.L., Gecsei J., Slutz D.R., and Traiger I.L. Evaluation techniques for storage hierarchies. IBM Systems Journal 9 2 (1970) 78-117
3. Motwani R., and Raghavan P. Randomized Algorithms (1995), Cambridge University Press, Cambridge