Another short proof of optimality for the MIN cache replacement algorithm
type: Item
instance of: scholarly article
title: Another short proof of optimality for the MIN cache replacement algorithm
zbMATH Open document ID: 1193.68074
author: Walter Vogler
published in: Information Processing Letters
publication date: 2010-04-19T00:00:00Z
Mathematics Subject Classification ID: 68N25
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5694936
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: caching
MaRDI profile type: Publication
full work available at URL: j.ipl.2007.12.001
OpenAlex ID: W2067242943
cites work: A short proof of optimality for the MIN cache replacement algorithm
DOI: 10.1016/J.IPL.2007.12.001
Recommended article: A short proof of optimality for the MIN cache replacement algorithm
Recommended article: A simple proof of optimality for the MIN cache replacement policy
Recommended article: A proof of the optimality of the MIN paging algorithm using linear programming duality
Recommended article: Q4952707
Recommended article: Towards a theory of cache-efficient algorithms
Recommended article: On the Complexity of Cache Analysis for Different Replacement Policies
Recommended article: Q5485326
Recommended article: An optimality proof of the LRU- K page replacement algorithm
Recommended article: A revised proof of the optimality for the Kise-Ibaraki-Mine algorithm
Recommended article: A proof of the Kikuta-Ruckle conjecture on cyclic caching of resources
description: scientific article; zbMATH DE number 5694936