The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies
Abstract
AbstractÐEfficient and effective buffering of disk blocks in main memory is critical for better file system performance due to a wide speed gap between main memory and hard disks. In such a buffering system, one of the most important design decisions is the block replacement policy that determines which disk block to replace when the buffer is full. In this paper, we show that there exists a spectrum of block replacement policies that subsumes the two seemingly unrelated and independent Least Recently Used (LRU) and Least Frequently Used (LFU) policies. The spectrum is called the LRFU (Least Recently/Frequently Used) policy and is formed by how much more weight we give to the recent history than to the older history. We also show that there is a spectrum of implementations of the LRFU that again subsumes the LRU and LFU implementations. This spectrum is again dictated by how much weight is given to recent and older histories and the time complexity of the implementations lies between O(1) (the time complexity of LRU) and O…log 2 n† (the time complexity of LFU), where n is the number of blocks in the buffer. Experimental results from trace-driven simulations show that the performance of the LRFU is at least competitive with that of previously known policies for the workloads we considered. Index TermsÐBuffer cache, LFU, LRU, replacement policy, trace-driven simulation. 1
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm
Johnson, T. J., & Shasha, D. E. (1994) · Cited by 614
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
Program Behavior: Models and Measurements
Spirn, J. R. (1977) · Elsevier eBooks · Cited by 125
Cited by
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
Finder highlights: field evaluation and design of an augmented file browser
Fitchett, S., Cockburn, A., & Gutwin, C. (2014) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/2556288.2557014 · Cited by 16
Metadata
- Authors
- Lee, D., Choi, J., Kim, J.-H., Noh, S. H., Min, S. L., Cho, Y., & Kim, C. S.
- Venue
- Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
- Publisher
- ACM
- Published
- 1999-05
- Pages
- 134-143
- OpenAlex
- W2039189705
- Cited by
- 278
- References
- 3
- FWCI
- 7.54
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies. https://app.cochat.ai/papers/10.1145/301453.301487
- The paper
- Lee, D., Choi, J., Kim, J.-H., Noh, S. H., Min, S. L., Cho, Y., & Kim, C. S. (1999). On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies. Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems. https://doi.org/10.1145/301453.301487
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.