原书出处
Introduction to Algorithms, Fourth Edition
27 第27章 在线算法
of a cache miss on the jth request for an old block is nij/(k − oij), or nij/(k − j + 1).
Since nij ≤ ri (recall that ri is the number of new requests during epoch i), we have an upper bound of ri/(k − j + 1) on the probability that the jth old request incurs a cache miss. We can now compute the expected number of misses during epoch i using
indicator random variables, as introduced in Section 5.2. We define indicator random vari
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter027.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea