原书出处
Introduction to Algorithms, Fourth Edition
27 第27章 在线算法
his behavior continues, alternately evicting blocks k and k+1 for the remaining requests.
LIFO, therefore, suffers a cache miss on every one of the n requests. The optimal offline algorithm knows the entire sequence of requests in advance. Upon the first request of block k + 1, it just evicts any block except block k, and then it never evicts
another block. Thus, the optimal offline algorithm evicts only once. Since the first k re
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter027.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea