Competitive analysis of caching
Kent Quanrud · 15:31
This lecture shows why cache replacement cannot be ranked by raw worst-case miss counts, then uses competitive analysis to prove that Least Frequently Used (LFU) can be arbitrarily worse than the hindsight-optimal pol...