[IEEE] TinyLFU: A Highly Efficient Cache Admission Policy

Cache Replacement

See Also

TinyLFU

• TinyLFU: A Highly Efficient Cache Admission Policy | IEEE Conference Publication | IEEE Xplore
• [1512.00727] TinyLFU: A Highly Efficient Cache Admission Policy
• [論文解讀][TinyLFU] A Highly Efficient Cache Admission Policy
• 论文《TinyLFU: A Highly E cient Cache Admission Policy》阅读笔记 - SegmentFault 思否
• TinyLFU -- A Highly Efficient Cache Admission Policy · Columba M71's Blog

Redis

• 阅读 redis 源码，学习缓存淘汰算法 W-TinyLFU | 董泽润的技术笔记
• [93面試常問：Redis 記憶體滿了怎麼辦？ | IT人]
• [Redis 系列]redis 学习十三，Redis 常问简单面试题 | Go 技术论坛