The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
LRFU: a spectrum of policies that subsumes the least recently used and least frequently used policies
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.
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
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
Evaluation techniques for storage hierarchies
Mattson, R. L., Gecsei, J., Slutz, D. R., & Traiger, I. L. (1970) · IBM Systems Journal · doi:10.1147/sj.92.0078 · Cited by 1,302
Coffman, E. G., & Denning, P. J. (1973) · Medical Entomology and Zoology · Cited by 694
The Design of the UNIX Operating System
Bach, M. J. (1986) · Cited by 660
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
Caching strategies to improve disk system performance
Karedla, R., Love, J. S., & Wherry, B. G. (1994) · Computer · doi:10.1109/2.268884 · Cited by 293
Program Behavior: Models and Measurements
Spirn, J. R. (1977) · Elsevier eBooks · Cited by 125
Cited by
CFLRU: a replacement algorithm for flash memory
Park, S.-Y., Jung, D., Kang, J.-U., Kim, J.-S., & Lee, J. (2006) · Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems · doi:10.1145/1176760.1176789 · Cited by 385
Self-citationJoint Communication, Computation, Caching, and Control in Big Data Multi-Access Edge Computing
Ndikumana, A., Tran, N. H., Ho, T. M., Han, Z., Saad, W., Niyato, D., & Hong, C. S. (2020) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2019.2908403 · Cited by 295
Video-Aware Scheduling and Caching in the Radio Access Network
Ahlehagh, H., & Dey, S. (2014) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2013.2294111 · Cited by 271
High 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
Outperforming LRU with an adaptive replacement cache algorithm
Megiddo, N., & Modha, D. S. (2004) · Computer · doi:10.1109/mc.2004.1297303 · Cited by 243
Metadata
- Authors
- Lee, D., Choi, J., Kim, J.-H., Noh, S. H., Min, S. L., Cho, Y., & Kim, C. S.
- Venue
- IEEE Transactions on Computers
- Published
- 2001-12
- Volume
- 50
- Issue
- 12
- Pages
- 1352-1361
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W2131806537
- Cited by
- 590
- References
- 8
- FWCI
- 9.10
- Type
- journal article
- 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: LRFU: a spectrum of policies that subsumes the least recently used and least frequently used policies. https://app.cochat.ai/papers/10.1109/tc.2001.970573
- The paper
- Lee, D., Choi, J., Kim, J.-H., Noh, S. H., Min, S. L., Cho, Y., & Kim, C. S. (2001). LRFU: a spectrum of policies that subsumes the least recently used and least frequently used policies. IEEE Transactions on Computers. https://doi.org/10.1109/tc.2001.970573
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.