{
  "slug": "lru-replacement",
  "term": "Least recently used replacement",
  "aliases": [
    "LRU",
    "least recently used"
  ],
  "definition": "Least recently used replacement evicts the resident entry whose most recent access is oldest.",
  "note": "One-time scans can evict reusable entries. [car]",
  "status": "research",
  "advantages": [],
  "limitations": [],
  "related": [
    "cache-pollution",
    "mapping-cache",
    "adaptive-replacement-cache"
  ],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-10-15",
  "citations": [
    {
      "id": "car",
      "title": "Sorav Bansal and Dharmendra S. Modha. CAR: Clock with Adaptive Replacement. FAST 2004; sections III-V.",
      "url": "https://www.usenix.org/legacy/events/fast04/tech/full_papers/bansal/bansal.pdf",
      "accessed": "2026-10-15"
    },
    {
      "id": "hesela",
      "title": "Hesela: mapping caches, scan phases and cache-history semantics (constructed examples)",
      "url": "https://hesela.com/analyses/ssd-mapping-cache-hmb/#scan-pollution",
      "accessed": "2026-10-15"
    }
  ]
}