Another short proof of optimality for the MIN cache replacement algorithm
From MaRDI portal
Publication:963371
DOI10.1016/J.IPL.2007.12.001zbMATH Open1193.68074OpenAlexW2067242943MaRDI QIDQ963371FDOQ963371
Publication date: 19 April 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.12.001
Recommendations
- A short proof of optimality for the MIN cache replacement algorithm
- A simple proof of optimality for the MIN cache replacement policy
- A proof of the optimality of the MIN paging algorithm using linear programming duality
- scientific article; zbMATH DE number 1445384
- Towards a theory of cache-efficient algorithms
- On the complexity of cache analysis for different replacement policies
- Near optimality of the discrete persistent access caching algorithm
- An optimality proof of the LRU- K page replacement algorithm
- A revised proof of the optimality for the Kise-Ibaraki-Mine algorithm
- A proof of the Kikuta-Ruckle conjecture on cyclic caching of resources
Cites Work
Cited In (2)
This page was built for publication: Another short proof of optimality for the MIN cache replacement algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963371)