The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
LIRS: an efficient low inter-reference recency set replacement policy to improve buffer cache performance
Abstract
Although LRU replacement policy has been commonly used in the buffer cache management, it is well known for its inability to cope with access patterns with weak locality. Previous work, such as LRU-K and 2Q, attempts to enhance LRU capacity by making use of additional history information of previous block references other than only the recency information used in LRU. These algorithms greatly increase complexity and/or can not consistently provide performance improvement. Many recently proposed policies, such as UBM and SEQ, improve replacement performance by exploiting access regularities in references. They only address LRU problems on certain specific and well-defined cases such as access patterns like sequences and loops. Motivated by the limits of previous studies, we propose an efficient buffer cache replacement policy, called Low Inter-reference Recency Set (LIRS). LIRS effectively addresses the limits of LRU by using recency to evaluate Inter-Reference Recency (IRR) for making a replacement decision. This is in contrast to what LRU does: directly using recency to predict next reference timing. At the same time, LIRS almost retains the same simple assumption of LRU to predict future access behavior of blocks. Our objectives are to effectively address the limits of LRU for a general purpose, to retain the low overhead merit of LRU, and to outperform those replacement policies relying on the access regularity detections. Conducting simulations with a variety of traces and a wide range of cache sizes, we show that LIRS significantly outperforms LRU, and outperforms other existing replacement algorithms in most cases. Furthermore, we show that the additional cost for implementing LIRS is trivial in comparison with LRU.
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
The working set model for program behavior
Denning, P. J. (1983) · Communications of the ACM · doi:10.1145/357980.357997 · Cited by 845
Coffman, E. G., & Denning, P. J. (1973) · Medical Entomology and Zoology · Cited by 694
The working set model for program behavior
Denning, P. J. (1968) · Communications of the ACM · doi:10.1145/363095.363141 · Cited by 662
Informed prefetching and caching
Patterson, R. H., Gibson, G. A., Ginting, E., Stodolsky, D., & Zelenka, J. (1995) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/224056.224064 · Cited by 654
2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm
Johnson, T. J., & Shasha, D. E. (1994) · Cited by 614
Denning, P. J. (1970) · ACM Computing Surveys · doi:10.1145/356571.356573 · Cited by 407
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
Lee, D., Choi, J., Kim, J.-H., Noh, S. H., Min, S. L., Cho, Y., & Kim, C. S. (1999) · Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/301453.301487 · Cited by 278
Cited by
Workload analysis of a large-scale key-value store
Atikoglu, B., Xu, Y., Frachtenberg, E., Jiang, S., & Paleczny, M. (2012) · Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems · doi:10.1145/2254756.2254766 · Cited by 901
Self-citationHigh performance cache replacement using re-reference interval prediction (RRIP)
Jaleel, A., Theobald, K. B., Steely, S. C., & Emer, J. (2010) · Proceedings of the 37th annual international symposium on Computer architecture · doi:10.1145/1815961.1815971 · Cited by 641
Cooperative Caching for Chip Multiprocessors
Chang, J., & Sohi, G. S. (2006) · ACM SIGARCH Computer Architecture News · doi:10.1145/1150019.1136509 · Cited by 355
Workload analysis of a large-scale key-value store
Atikoglu, B., Xu, Y., Frachtenberg, E., Jiang, S., & Paleczny, M. (2012) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/2318857.2254766 · Cited by 268
Self-citationHigh performance cache replacement using re-reference interval prediction (RRIP)
Jaleel, A., Theobald, K. B., Steely, S. C., & Emer, J. (2010) · ACM SIGARCH Computer Architecture News · doi:10.1145/1816038.1815971 · Cited by 264
Metadata
- Authors
- Jiang, S., & Zhang, X.
- Venue
- Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
- Publisher
- ACM
- Published
- 2002-06
- Pages
- 31-42
- OpenAlex
- W2072853307
- Cited by
- 489
- References
- 8
- FWCI
- 10.98
- 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.