SS-LRU: a smart segmented LRU caching
Chunhua Li, Man Wu, Yuhan Liu, Ke Zhou, Ji Zhang, Yunqing Sun
Abstract
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.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 4aa8a630-bbfd-499f-a8df-7c1724922e33Cited by top-tier papers1
Ask how each one uses itRelated papers
- Predicting Reuse Interval for Optimized Web Caching: An LSTM-Based Machine Learning ApproachPengcheng Li, Yixin Guo, Yongbin GuSC 2022 · 2 citations
- Learning Cache Replacement with CACHEUSLiana V. Rodriguez, Farzana Beente Yusuf, Steven Lyons, Eysler Paz et al.FAST 2021 · 26 citations
- Designing a Cost-Effective Cache Replacement Policy using Machine LearningSubhash Sethumurugan, Jieming Yin, John SartoriHPCA 2021 · 81 citations
- Robust Learning-Augmented Caching: An Experimental StudyJakub Chledowski, Adam Polak, Bartosz Szabucki, Konrad Tomasz ZolnaICML 2021 · 21 citations
- Effective Mimicry of Belady's MIN PolicyIshan Shah, Akanksha Jain, Calvin LinHPCA 2022 · 44 citations
