← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

27 第27章 在线算法

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

d MARKING. Rather than “least recently used,” think of MARKING as simply “recently used.”

MARKING maintains a 1-bit attribute mark for each block in the cache. Initially, all blocks in the cache are unmarked. When a block is requested, if it is already in the cache, it is marked. If the request is a cache miss, MARKING checks to see whether

there are any unmarked blocks in the cache. If all blocks are marked, then they are all c

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea