← 返回刚才阅读的位置

知识卡片

普通读书笔记卡 · 2313.e.5.f.10.b.3.e.1.a.1.b.4

LFU保留常用也需老化

理解等级:中级

LFU优先淘汰访问频率低的数据,适合较稳定热度。历史高频对象可能长期占住空间而新热点难进入,因此需要关注计数老化和工作集变化,不把历史热门等同未来有用。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • Distributed Caching · 查看原书依据

      Least frequently used (LFU) is useful for data with varying access patterns. LFU shines in scenarios with clear frequency patterns. However, it can be slow to adapt to changing patterns.

    参考来源

    - 位置:《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) - 结论依据:原文的机制或对比支持以下核心判断:LFU优先淘汰访问频率低的数据,适合较稳定热度。 本卡将相邻说明中的适用限制保留为解释。 - 原始内容:Least frequently used (LFU) is useful for data with varying access patterns. LFU shines in scenarios with clear frequency patterns. However, it can be slow to adapt to changing patterns.