The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
High performance cache replacement using re-reference interval prediction (RRIP)
Abstract
Practical cache replacement policies attempt to emulate optimal replacement by predicting the re-reference interval of a cache block. The commonly used LRU replacement policy always predicts a near-immediate re-reference interval on cache hits and misses. Applications that exhibit a distant re-reference interval perform badly under LRU. Such applications usually have a working-set larger than the cache or have frequent bursts of references to non-temporal data (called scans). To improve the performance of such workloads, this paper proposes cache replacement using Re-reference Interval Prediction (RRIP). We propose Static RRIP (SRRIP) that is scan-resistant and Dynamic RRIP (DRRIP) that is both scan-resistant and thrash-resistant. Both RRIP policies require only 2-bits per cache block and easily integrate into existing LRU approximations found in modern processors. Our evaluations using PC games, multimedia, server and SPEC CPU2006 workloads on a single-core processor with a 2MB last-level cache (LLC) show that both SRRIP and DRRIP outperform LRU replacement on the throughput metric by an average of 4% and 10% respectively. Our evaluations with over 1000 multi-programmed workloads on a 4-core CMP with an 8MB shared LLC show that SRRIP and DRRIP outperform LRU replacement on the throughput metric by an average of 7% and 9% respectively. We also show that RRIP outperforms LFU, the state-of the art scan-resistant replacement algorithm to-date. For the cache configurations under study, RRIP requires 2X less hardware than LRU and 2.5X less hardware than LFU.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Pin: building customized program analysis tools with dynamic instrumentation
Luk, C.-K., Cohn, R., Muth, R., Patil, H., Klauser, A., Lowney, G., Wallace, S., Reddi, V. J., & Hazelwood, K. (2005) · ACM SIGPLAN Notices · doi:10.1145/1064978.1065034 · Cited by 3,180
Pin: building customized program analysis tools with dynamic instrumentation
Luk, C.-K., Cohn, R., Muth, R., Patil, H., Klauser, A., Lowney, G., Wallace, S., Reddi, V. J., & Hazelwood, K. (2005) · Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation · doi:10.1145/1065010.1065034 · Cited by 2,310
A study of replacement algorithms for a virtual-storage computer
Belady, L. A. (1966) · IBM Systems Journal · doi:10.1147/sj.52.0078 · Cited by 1,659
ARC: a self-tuning, low overhead replacement cache
Megiddo, N., & Modha, D. S. (2003) · File and Storage Technologies · Cited by 1,120
The LRU-K page replacement algorithm for database disk buffering
O'Neil, E. J., O'Neil, P. E., & Weikum, G. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170081 · Cited by 892
2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm
Johnson, T. J., & Shasha, D. E. (1994) · Very Large Data Bases · Cited by 811
Lee, D., Choi, J., Kim, J.-H., Noh, S. H., Min, S. L., Cho, Y., & Kim, C. S. (2001) · IEEE Transactions on Computers · doi:10.1109/tc.2001.970573 · Cited by 590
Jiang, S., & Zhang, X. (2002) · Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/511334.511340 · Cited by 489
The Multi-Queue Replacement Algorithm for Second Level Buffer Caches
Zhou, Y., Philbin, J. F., & Li, K. (2001) · USENIX Annual Technical Conference · Cited by 408
Data cache management using frequency-based replacement
Robinson, J. T., & Devarakonda, M. V. (1990) · Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems - SIGMETRICS '90 · doi:10.1145/98457.98523 · Cited by 394
CAR: Clock with Adaptive Replacement
Bansal, S., & Modha, D. S. (2004) · File and Storage Technologies · Cited by 294
Cited by
Tiered-latency DRAM: A low latency and low cost DRAM architecture
Lee, D., Kim, Y., Seshadri, V., Liu, J., Subramanian, L., & Mutlu, O. (2013) · 2013 IEEE 19th International Symposium on High Performance Computer Architecture (HPCA) · doi:10.1109/hpca.2013.6522354 · Cited by 263
A deep reinforcement learning-based framework for content caching
Zhong, C., Gursoy, M. C., & Velipasalar, S. (2018) · 2018 52nd Annual Conference on Information Sciences and Systems (CISS) · doi:10.1109/ciss.2018.8362276 · Cited by 231
Metadata
- Authors
- Jaleel, A., Theobald, K. B., Steely, S. C., & Emer, J.
- Venue
- Proceedings of the 37th annual international symposium on Computer architecture
- Publisher
- ACM
- Published
- 2010-06-19
- Pages
- 60-71
- ISSN
- 1063-6897 (ISSN-L)
- OpenAlex
- W2029577083
- Cited by
- 641
- References
- 11
- FWCI
- 27.06
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.