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 (2007) [3] and Vogler (2008) [4]. We provide a simpler proof based on a novel invariant condition maintained through an incremental procedure.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have