cache-inclusion-property · research · also Stack property, Stack inclusion property

Cache inclusion property

The cache inclusion property requires the resident set at a smaller capacity to be contained in that at a larger capacity after each shared request prefix under the same replacement policy.

Related Observatory article: Cache inclusion property on hesela.com

Fully associative, equal-size demand LRU has this property, so a hit at the smaller capacity remains a hit at the larger one. This is a capacity-comparison property, not a claim that a physical multi-level cache hierarchy is inclusive. [1]

Passing a finite trace sweep does not prove the property for an arbitrary policy. [2]

Relations

related
lru-replacement, fifo-replacement, belady-anomaly

Citations

  1. Wires et al. Characterizing Storage Workloads with Counter Stacks. OSDI 2014 author slides, pages 20-22: inclusion and LRU stack algorithms. (accessed 2026-10-17)
  2. Hesela: finite cache-capacity replay, with full traces and assumptions. (accessed 2026-10-17)

JSON: /data/terms/cache-inclusion-property.json