MUSTACHE: Multi-Step-Ahead Predictions for Cache Eviction
Not on the map. Why?
Abstract (arXiv)
In this work, we propose MUSTACHE, a new page cache replacement algorithm whose logic is learned from observed memory access requests rather than fixed like existing policies. We formulate the page request prediction problem as a categorical time series forecasting task. Then, our method queries the learned page request forecaster to obtain the next k predicted page memory references to better approximate the optimal B'el'ady's replacement algorithm. We implement several forecasting techniques using advanced deep learning architectures and integrate the best-performing one into an existing open-source cache simulator. Experiments run on benchmark datasets show that MUSTACHE outperforms the best page replacement heuristic (i.e., exact LRU), improving the cache hit ratio by 1.9% and reducing the number of reads/writes required to handle cache misses by 18.4% and 10.3%.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 20 references that are in the map. First posted on arXiv 3 Nov 2022.
Builds on
5 of 20 references.
References · 5
- 2014Sequence to Sequence Learning with Neural Networkscited by 2,974
- 2020Time Series Forecasting With Deep Learning: A Surveycited by 457
- 2018Learning Memory Access Patternscited by 28
- 2021Evaluation of deep learning models for multi-step ahead time series predictioncited by 25
- 2018A neural network memory prefetcher using semantic localitycited by 6
Built on by
Not cited yet.