{
  "id": "enwiki-001313554391",
  "slug": "cache-hierarchy",
  "title": "Cache hierarchy",
  "qid": "",
  "lead": "Cache hierarchy, or multi-level cache, is a memory architecture that uses a hierarchy of memory stores based on varying access speeds to cache data. Highly requested data is cached in high-speed access memory stores, allowing swifter access by central processing unit (CPU) cores. Cache hierarchy is a form and part of memory hierarchy and can be considered a form of tiered storage. This design was intended to allow CPU cores to process faster despite the memory latency of main memory access. Accessing main memory can act as a bottleneck for CPU core performance as the CPU waits for data, while making all of main memory high-speed may be prohibitively expensive. High-speed caches are a compromise allowing high-speed access to the data most-used by the CPU, permitting a faster CPU clock.",
  "body": "Cache hierarchy, or multi-level cache, is a memory architecture that uses a hierarchy of memory stores based on varying access speeds to cache data. Highly requested data is cached in high-speed access memory stores, allowing swifter access by central processing unit (CPU) cores. Cache hierarchy is a form and part of memory hierarchy and can be considered a form of tiered storage. This design was intended to allow CPU cores to process faster despite the memory latency of main memory access. Accessing main memory can act as a bottleneck for CPU core performance as the CPU waits for data, while making all of main memory high-speed may be prohibitively expensive. High-speed caches are a compromise allowing high-speed access to the data most-used by the CPU, permitting a faster CPU clock. \\text{AAT} = \\text{hit time}+((\\text{miss rate})\\times(\\text{miss penalty})) AAT for main memory is given by Hit time main memory . AAT for caches can be given by: Hit Time cache + (Miss Rate cache × Miss Penalty time taken to go to main memory after missing cache ). The hit time for caches is less than the hit time for the main memory, so the AAT for data retrieval is significantly lower when accessing data through the cache rather than main memory. Example: main memory = 50&nbsp; , L1 = 1&nbsp;ns with 10% miss rate, L2 = 5&nbsp;ns with 1% miss rate, L3 = 10&nbsp;ns with 0.2% miss rate. No cache, AAT = 50&nbsp;ns L1 cache, AAT = 1&nbsp;ns + (0.1 × 50&nbsp;ns) = 6&nbsp;ns L1–2 caches, AAT = 1&nbsp;ns + (0.1 × [5&nbsp;ns + (0.01 &times; 50&nbsp;ns)]) = 1.55&nbsp;ns L1–3 caches, AAT = 1&nbsp;ns + (0.1 × [5&nbsp;ns + (0.01 &times; [10&nbsp;ns + (0.002 × 50&nbsp;ns)])]) = 1.5101&nbsp;ns",
  "categories": [
    "10639794",
    "20202781",
    "22960149",
    "23053716",
    "23589811",
    "23603337",
    "24745122",
    "24866447",
    "25414829",
    "26220375"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1313554391",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1758916653.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001313554391",
    "type": "webpage",
    "title": "Cache hierarchy",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/cache-hierarchy",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          22
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          22
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001313554391",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1313554391",
    "note": "Immutable snapshot enwiki-001313554391"
  }
}