SS-LRU: a smart segmented LRU caching
Chunhua Li, Man Wu, Yuhan Liu, Ke Zhou, Ji Zhang, Yunqing Sun
摘要
Many caching policies use machine learning to predict data reuse, but they ignore the impact of incorrect prediction on cache performance, especially for large-size objects. In this paper, we propose a smart segmented LRU (SS-LRU) replacement policy, which adopts a size-aware classifier designed for cache scenarios and considers the cache cost caused by misprediction. Besides, SS-LRU enhances the migration rules of segmented LRU (SLRU) and implements a smart caching with unequal priorities and segment sizes based on prediction and multiple access patterns. We conducted Extensive experiments under the real-world workloads to demonstrate the superiority of our approach over state-of-the-art caching policies.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
引用它的顶会 Paper1
问问它们各自怎么用它相关 Paper
- Predicting Reuse Interval for Optimized Web Caching: An LSTM-Based Machine Learning ApproachPengcheng Li, Yixin Guo, Yongbin GuSC 2022 · 被引用 2 次
- Learning Cache Replacement with CACHEUSLiana V. Rodriguez, Farzana Beente Yusuf, Steven Lyons, Eysler Paz 等FAST 2021 · 被引用 26 次
- Designing a Cost-Effective Cache Replacement Policy using Machine LearningSubhash Sethumurugan, Jieming Yin, John SartoriHPCA 2021 · 被引用 81 次
- Robust Learning-Augmented Caching: An Experimental StudyJakub Chledowski, Adam Polak, Bartosz Szabucki, Konrad Tomasz ZolnaICML 2021 · 被引用 21 次
- Effective Mimicry of Belady's MIN PolicyIshan Shah, Akanksha Jain, Calvin LinHPCA 2022 · 被引用 44 次
