The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
CFLRU: a replacement algorithm for flash memory
Abstract
In most operating systems which are customized for disk-based storage system, the replacement algorithm concerns only the number of memory hits. However, flash memory has different read and write cost in the aspects of time and energy so the replacement algorithm with flash memory should consider not only the hit count but also the replacement cost caused by selecting dirty victims. The replacement cost of dirty page is higher than that of clean page with regard to both access time and energy consumption. In this paper, we propose the Clean-First LRU (CFLRU) replacement algorithm that exploits the characteristics of flash memory. CFLRU splits the LRU list into the working region and the clean-first region and adopts a policy that evicts clean pages preferentially in the clean-first region until the number of page hits in the working region is preserved in a suitable level. Using the trace-driven simulation, the proposed algorithm reduces the average replacement cost by 28.4% in swap system and by 26.2% in buffer cache, compared with LRU algorithm. We also implement the CFLRU algorithm in the Linux kernel and present some optimization issues.
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
Constructing Induction Rules for Deductive Synthesis Proofs
Bundy, A., Dixon, L., Gow, J., & Fleuriot, J. (2006) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2005.08.003 · Cited by 2,806
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
Understanding the Linux Kernel
Bovet, D. P., Cassetti, M., & Oram, A. (2000) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,181
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
The working set model for program behavior
Denning, P. J. (1983) · Communications of the ACM · doi:10.1145/357980.357997 · Cited by 845
2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm
Johnson, T. J., & Shasha, D. E. (1994) · Very Large Data Bases · Cited by 811
The working set model for program behavior
Denning, P. J. (1968) · Communications of the ACM · doi:10.1145/363095.363141 · Cited by 662
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
Self-citationThek-server dual and loose competitiveness for paging
Young, N. (1994) · Algorithmica · doi:10.1007/bf01189992 · Cited by 252
Cited by
Bergman, S., Cassel, N., Bjørling, M., & Silberstein, M. (2023) · ACM Transactions on Storage · doi:10.1145/3582434 · Cited by 38
Metadata
- Authors
- Park, S.-Y., Jung, D., Kang, J.-U., Kim, J.-S., & Lee, J.
- Venue
- Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems
- Publisher
- ACM
- Published
- 2006-10-22
- Pages
- 234-241
- OpenAlex
- W2038619757
- Cited by
- 385
- References
- 11
- FWCI
- 5.60
- 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.