原书出处
Introduction to Algorithms, Fourth Edition
27 第27章 在线算法
equest. Because j − 1 old requests occur before the jth old request, we have oij = j − 1.
We will show that the probability of a cache miss upon the j th old request is nij/(k − oij), or nij/(k − j + 1). Start by considering the first old request, for block bi,1. What is the probability that this request causes a cache miss? It causes a
cache miss precisely when one of the ni,1 previous requests resulted in bi,1 being evicte
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter027.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea