Randomized caching
Kent Quanrud · 14:36
Randomized not-recently-used (NRU) caching beats last lecture’s deterministic factor-\(k\) bound: by refining how many misses OPT must incur on “new” items and evicting unmarked pages uniformly at random, the expected...