← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

27 第27章 在线算法

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

arding all other requests. We can classify the requests in an epoch as either old or new.

If block b resides in the cache at the start of epoch i, each request for block b during epoch i is an old request. Old requests in epoch i are for blocks requested in epoch i − 1. If a request in epoch i is not old, it is a new request, and it is for a block not

requested in epoch i − 1. All requests in epoch 1 are new. For example, let’s look again

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea