{
  "slug": "fifo-replacement",
  "term": "First-in first-out cache replacement",
  "aliases": [
    "FIFO replacement"
  ],
  "definition": "First-in first-out cache replacement evicts the resident entry that was inserted earliest, without refreshing its queue position on a hit.",
  "note": "This policy concerns eviction, not request scheduling or write durability. A larger FIFO cache can have more misses on the same reference string. [fifo-unbounded]",
  "related": [
    "belady-anomaly",
    "cache-inclusion-property",
    "lru-replacement",
    "clock-replacement",
    "sieve-eviction"
  ],
  "citations": [
    {
      "id": "fifo-unbounded",
      "title": "Peter Fornai and Antal Ivanyi. FIFO anomaly is unbounded. Acta Univ. Sapientiae, Informatica 2(1), 2010, pp. 80-89; sections 2-5, arXiv:1003.1336v2.",
      "url": "https://arxiv.org/pdf/1003.1336v2",
      "accessed": "2026-10-17"
    },
    {
      "id": "hesela",
      "title": "Hesela: finite cache-capacity replay, with full traces and assumptions.",
      "url": "https://hesela.com/analyses/sieve-cache-eviction-traces/#capacity",
      "accessed": "2026-10-17"
    }
  ],
  "status": "research",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-10-17",
  "provenance": [
    "The paired replay exposes every request outcome and queue state under equal-size, cold-start, immediate-admission assumptions. [hesela]"
  ]
}