原书出处
Introduction to Algorithms, Fourth Edition
27 第27章 在线算法
che of size k. Proof To analyze LRU, we will divide the sequence of requests into epochs.
Epoch 1 begins with the first request. Epoch i, for i > 1, begins upon encountering the (k + 1)st distinct request since the beginning of epoch i − 1. Consider the following example of requests with k = 3: The first k = 3
distinct requests are for blocks 1, 2 and 5, so epoch 2 begins with the first request for
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter027.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea