原书出处
Introduction to Algorithms, Fourth Edition
15 第15章 贪心算法
equests and the cache size k, with a goal of minimizing the total number of cache misses.
To solve this offline problem, you can use a greedy strategy called furthest-in-future, which chooses to evict the block in the cache whose next access in the request sequence comes furthest in the future.
Intuitively, this strategy makes sense: if you’re not going to need something for a while
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter015.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea