A simple proof of optimality for the MIN cache replacement policy
Abstract
The MIN cache replacement algorithm is an optimal off-line policy to decide which item to evict when a new item should be fetched into a cache.
Recently, two short proofs were given by van Roy and Vogler.. We provide a simpler proof based on a novel invariant condition maintained through an incremental procedure.
Domains
Hardware Architecture [cs.AR]
Origin : Files produced by the author(s)
Loading...