← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

27 第27章 在线算法

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.749Z

many online caching policies to determine which block to evict, including the following:

First-in, first-out (FIFO): evict the block that has been in the cache the longest time. Last-in, first-out (LIFO): evict the block that has been in the cache the shortest time. Least Recently Used (LRU): evict the block whose last use is furthest in the past. Least Frequently Used (LFU): evict the block that has been accessed the fewest times, breaking ties by choosing the block that has been in the cache the longest. To analyze these algorithms, we assume that

the cache starts out empty, so that no evictions occur during the first k requests. We wi

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter027.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea