原书出处
Introduction to Algorithms, Fourth Edition
27 第27章 在线算法
− 1. Therefore, the number of distinct requests during epochs i−1 and i is exactly k+ri.
No matter what the cache contents were at the beginning of epoch i − 1, after k + ri distinct requests, there must be at least ri cache misses. There could be more, but there is no way to have fewer. Letting mi denote the number of cache misses of the
offline algorithm during epoch i, we have just argued that The total number of cache miss
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter027.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea