CoChat

Outperforming LRU with an adaptive replacement cache algorithm

Megiddo, N., Modha, D.S. · 2004 · Computer

The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.

Abstract

The self-tuning, low-overhead, scan-resistant adaptive replacement cache algorithm outperforms the least-recently-used algorithm by dynamically responding to changing access patterns and continually balancing between workload recency and frequency features. Caching, a fundamental metaphor in modern computing, finds wide application in storage systems, databases, Web servers, middleware, processors, file systems, disk drives, redundant array of independent disks controllers, operating systems, and other applications such as data compression and list updating. In a two-level memory hierarchy, a cache performs faster than auxiliary storage, but it is more expensive. Cost concerns thus usually limit cache size to a fraction of the auxiliary memory's size.

Overview

Integrity signals

Registry

Crossref · 10.1109/mc.2004.1297303

Cites

18 of 18 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 18 references

Research works printed but not linked: 1

  1. Corbato, 1969, A Paging Experiment with the Multics System, 217

Cited by

See all 274

Metadata

Authors
Megiddo, N., & Modha, D. S.
Affiliations
IBM Research - Almaden (US)
Venue
Computer
Published
2004-04
Volume
37
Issue
4
Pages
58-65
ISSN
0018-9162 (ISSN-L)
OpenAlex
W2003549201
Cited by
243
References
18
Citations by year
2026: 6 · 2025: 5 · 2024: 6 · 2023: 9 · 2022: 9 · 2021: 13 · 2020: 11 · 2019: 9 · 2018: 16 · 2017: 19 · 2016: 17 · 2015: 12 · 2014: 18 · 2013: 11 · 2012: 17
FWCI
14.18
Type
journal article
Language
en
Open access
closed
Locations
Computer (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
  • Physical Sciences › Computer Science › Computer Networks and Communications › Caching and Content Delivery
  • Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Data Storage Technologies
Keywords
LRU cache, cache replacement policy, auto-tuning

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: Outperforming LRU with an adaptive replacement cache algorithm. https://app.cochat.ai/papers/10.1109/mc.2004.1297303
The paper
Megiddo, N., & Modha, D. S. (2004). Outperforming LRU with an adaptive replacement cache algorithm. Computer. https://doi.org/10.1109/mc.2004.1297303

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.