Last-Level Cache Insertion and Promotion Policy in the Presence of Aggressive Prefetching
- 3 February 2023
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 22 (1) , 17-20
Abstract
The last-level cache (LLC) is the last chance for memory accesses from the processor to avoid the costly latency of going to main memory. LLC management has been the topic of intense research focusing on two main techniques: replacement and prefetching. However, these two ideas are often evaluated separately, with one being studied outside the context of the state-of-the-art in the other. We find that high-performance replacement and highly accurate pattern-based prefetching do not result in synergistic improvements in performance. The overhead of complex replacement policies is wasted in the presence of aggressive prefetchers. We find that a simple replacement policy with minimal overhead provides at least the same benefit as a state-of-the-art replacement policy in the presence of aggressive pattern-based prefetching. Our proposal is based on the idea of using a genetic algorithm to search the space of insertion and promotion policies that generalize transitions in the recency stack for the least-recently-used policy.Keywords
Funding Information
- National Science Foundation (CNS-1938064, CCF-1912617)
- Semiconductor Research Corporation (GRC 2936.001)
This publication has 18 references indexed in Scilit:
- Kill the Program Counter2017
- Perceptron learning for reuse prediction2016
- Path confidence based lookahead prefetching2016
- Back to the Future: Leveraging Belady's Algorithm for Improved Cache Replacement2016
- Best-offset hardware prefetching2016
- Minimal disturbance placement and promotion2016
- Insertion policy selection using Decision Tree Analysis2010
- Adaptive insertion policies for high performance caching2007
- Using SimPoint for accurate and efficient simulationACM SIGMETRICS Performance Evaluation Review, 2003
- Dead-block prediction & dead-block correlating prefetchersACM SIGARCH Computer Architecture News, 2001