知识卡片
LRU跟随近期访问
LRU优先淘汰最长时间未使用的数据,利用近期访问较可能再次访问的时间局部性。它能适应热度变化,但一次性批量扫描可能挤掉仍有价值的热点,不能只根据名称决定策略。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- Distributed Caching · 查看原书依据
Least recently used (LRU) is useful when items are used frequently for a while, then usage drops. This policy works particularly well for systems with temporal locality where recently accessed data is likely to be accessed again soon.
参考来源
- 位置:《Building Distributed Systems Designing scalable architectures with microservices, event-driven patterns, and robust deployment…》第11章《Distributed Caching》(来源项目book-sources;源文件:extracted/Building Distributed Systems Designing scalable architectures with microservices, event-driven patterns, and robust deployment…/_epub-src/OPS/ch11.xhtml)
- 结论依据:原文的机制或对比支持以下核心判断:LRU优先淘汰最长时间未使用的数据,利用近期访问较可能再次访问的时间局部性。 本卡将相邻说明中的适用限制保留为解释。
- 原始内容:Least recently used (LRU) is useful when items are used frequently for a while, then usage drops. This policy works particularly well for systems with temporal locality where recently accessed data is likely to be accessed again soon.