{
  "slug": "working-set-footprint",
  "term": "Working-set footprint",
  "aliases": [
    "average footprint",
    "complete-window footprint"
  ],
  "definition": "A working-set footprint is the average number of distinct data identities accessed across all complete windows of a specified length in a trace.",
  "note": "For n requests and a window of w requests, average the distinct counts over n-w+1 complete windows. This is a trace statistic, not the amount of resident memory. The mean that includes truncated initial windows instead averages over n endpoints; report which convention is used. [hotl] [ws-analytics]\n\nFinite-trace formulas retain first- and last-access corrections. A long-trace approximation cannot silently replace those terms for a short observation. HOTL explicitly states a reuse-window condition for converting footprint statistics to cache misses. [rtl] [hotl]\n\nHesela's exact constructed traces BBACA and ACBBA both access A twice, B twice and C once. Their complete-window footprint curves are identical: 1, 7/4, 7/3, 3, 3. Yet initially empty, fully associative, two-entry LRU caches with demand admission miss 3/5 and 4/5 respectively. Thus this average curve and these frequencies alone do not determine the finite-trace LRU miss count. These are logical examples, not measured workloads. [example]\n\nIncluding truncated initial windows is not always a downward shift. At window length three, ABBBBBBB and its reversal BBBBBBBA have the same complete-window footprint 7/6, but prefix means 5/4 and 9/8. Their signed differences are +1/12 and -1/24 identities. If F is the complete mean and S_initial sums distinct counts in the first w-1 prefixes, then n*(P-F)=S_initial-(w-1)*F. This is a deterministic accounting identity, not a statistical bias estimate. [endpoints] [ws-analytics]",
  "status": "research",
  "advantages": [],
  "limitations": [
    {
      "text": "State the identity unit, clock, endpoint treatment and cache model before interpreting footprint as a capacity requirement.",
      "citationIds": [
        "hotl",
        "rtl"
      ]
    },
    {
      "text": "A long trace alone does not make endpoint effects small when the requested window grows with it; use the explicit window/trace-length bound and do not interpret it as a cache-miss guarantee.",
      "citationIds": [
        "endpoints"
      ]
    }
  ],
  "related": [
    "working-set",
    "miss-ratio-curve"
  ],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-18",
  "citations": [
    {
      "id": "hotl",
      "title": "Xiaoya Xiang, Chen Ding, Hao Luo and Bin Bao. HOTL: a Higher Order Theory of Locality. ASPLOS 2013, sections 2.2 and 2.7.",
      "url": "https://www.cs.rochester.edu/~cding/dpal/files/Xiang%2B_ASPLOS13.pdf",
      "accessed": "2026-11-18"
    },
    {
      "id": "rtl",
      "title": "Yuan et al. A Relational Theory of Locality. ACM TACO 16(3), Article 33 (2019), sections 2.4.2-2.4.6. DOI 10.1145/3341109.",
      "url": "https://denninginstitute.com/pjd/PUBS/TACO-2019.pdf",
      "accessed": "2026-11-18"
    },
    {
      "id": "ws-analytics",
      "title": "Peter J. Denning. Working Set Analytics. ACM Computing Surveys 53(6), Article 113 (2021), appendix. DOI 10.1145/3399709.",
      "url": "https://denninginstitute.com/pjd/PUBS/working-set-analytics-2021.pdf",
      "accessed": "2026-11-18"
    },
    {
      "id": "example",
      "title": "Hesela: exact finite-window footprints and cold LRU witness; inputs, integer sums, fractions and reproduction.",
      "url": "https://hesela.dev/research/footprint-windows/evidence.json",
      "accessed": "2026-11-18"
    },
    {
      "id": "model",
      "title": "Hesela: CC0 absence-gap footprint calculation.",
      "url": "https://hesela.dev/research/footprint-windows/model.mjs",
      "accessed": "2026-11-18"
    },
    {
      "id": "method",
      "title": "Hesela: method, limitations, tests and unchanged LRU dependency.",
      "url": "https://hesela.dev/research/footprint-windows/method.md",
      "accessed": "2026-11-18"
    },
    {
      "id": "hesela",
      "title": "Hesela: identical window footprints can hide different LRU misses.",
      "url": "https://hesela.com/analyses/ssd-mapping-cache-hmb/#footprint-windows",
      "accessed": "2026-11-18"
    },
    {
      "id": "endpoints",
      "title": "Hesela: signed endpoint ledger, conservative two-sided bound and periodic controls; generated exact examples.",
      "url": "https://hesela.dev/research/footprint-windows/endpoints.json",
      "accessed": "2026-11-18"
    }
  ],
  "provenance": [
    "Primary full-text sections reviewed 2026-11-18; no author benchmark replication or new hardware measurement.",
    "Exact constructed examples generated from versioned CC0 code; tests independently enumerate complete and truncated windows.",
    "The absence-gap calculation is an equivalent form of the established boundary-aware Xiang formula, not a new algorithm."
  ]
}
