Working Set¶

Estimate a running process's current memory demand as the distinct pages referenced within a moving process-time window, and use that demand to govern residency and load.

Version: v3 · 2026-09-06 · History
Domain-specific #: 3125
Origin domain: computer science
Subdomain: operating systems
Aliases: Working-set model, Process working set, Working set of pages

Core Idea¶

The Working Set is Peter J. Denning's operational model of a running computation's immediate memory demand. Let a process's page-reference string be observed in process time. Its working set \(W(t,\tau)\) is the set of distinct pages referenced during the interval \((t-\tau,t)\), where \(\tau\) is a declared window length. The cardinality \(w(t,\tau)=|W(t,\tau)|\) estimates how many pages the process needs resident to continue its current locality with a low fault rate. This is a time-indexed demand estimate, not a permanent property of the program or a synonym for every page presently in memory.

Scope of Application¶

The Working Set is literal when recent distinct memory references are used to estimate a process's drifting demand and to inform page residency or system load.

Demand-paged virtual memory. Per-process page demand guides allocation and replacement.
Multiprogramming control. Aggregate working-set demand informs which processes can remain active.
Thrashing analysis. Capacity shortfall relative to active localities explains sustained fault-dominated execution.
Cache analysis. Reuse windows can approximate hot subsets when the memory unit and timing convention are explicit.
Performance diagnosis. Working-set curves show how footprint grows with observation window.
Algorithm design. Exact definitions serve as ideals against which approximate aging or clock policies are compared.
Capacity planning. Workload traces support demand distributions rather than a single peak allocation guess.
Phase analysis. Changes in set membership reveal transitions among program localities.

Clarity¶

Define process time, the reference unit, whether the interval endpoints are open or closed, the window \(\tau\), reference collection method, transient treatment, and whether the reported object is the exact set, its size, or an approximation. Separate demanded pages from pages actually resident and from pages merely mapped into the address space. State sampling and hardware-bit limitations. When aggregating, identify active processes and available frames at the same instant.

Manages Complexity¶

Memory allocation couples millions of references, changing program phases, finite frames, slow secondary storage, and many competing processes. The Working Set compresses a reference history into a current set and size, turning an unbounded trace into a manageable demand signal. It localizes control: retain recently active pages for each process, sum their demands, and reduce load when capacity cannot support them. This compression introduces a parameter and measurement burden.

Abstract Reasoning¶

Choose the memory unit and collect each process's ordered reference stream. 2. Measure time in the declared process-time convention. 3. Select and justify a candidate recency window \(\tau\). 4. At time \(t\), collect distinct pages referenced in \((t-\tau,t)\). 5. Compute the working-set size and compare it with actual resident allocation. 6. Advance the window, adding new pages and expiring pages whose last reference falls outside it.

Knowledge Transfer¶

Locality of Reference is the strict parent by composition and presupposition. The Working Set operationalizes the prime's small, drifting hot subset with an exact recency-set estimator and then uses that estimate for memory and load control. Locality explains why recent references predict near-future demand; the domain residual is \(W(t,\tau)\), its cardinality, aggregation across processes, and the residency/thrashing policy interpretation.

Relationships to Other Abstractions¶

Current abstraction Working Set Domain-specific

Parents (1) — more general patterns this builds on

Working Set is a kind of Locality Of Reference Prime

Locality of Reference is the strict parent by composition/presupposition.

Neighborhood in Abstraction Space¶

Working Set sits in a sparse region of the domain-specific corpus (97^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08