Demand paging¶
A virtual-memory policy that loads a page into physical memory only after an attempted access faults on that absent page.
Core Idea¶
It separates allocation of virtual address space from residency, and performance depends on locality, working-set size, replacement policy, backing storage and fault cost. A page-table entry marks a page nonresident, hardware traps its first access, the operating system obtains a frame and loads the page, updates translation state and resumes the faulting instruction. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.
Scope of Application¶
Demand paging belongs to operating systems and is useful where the analyst can specify the typed operating systems carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the virtual page and process, residency and page-table state, access and page fault, backing-store location, frame allocation and replacement, load and translation update, instruction restart and locality and thrashing conditions are explicit. The scope is broad within that domain but bounded by the need for the virtual page and process, residency and page-table state, access and page fault, backing-store location, frame allocation and replacement, load and translation update, instruction restart and locality and thrashing conditions are explicit.
Clarity¶
The abstraction clarifies a crowded vocabulary by making the virtual page and process, residency and page-table state, access and page fault, backing-store location, frame allocation and replacement, load and translation update, instruction restart and locality and thrashing conditions are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.
Manages Complexity¶
Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Demand paging. Demand paging compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.
Abstract Reasoning¶
- Identify the carrier. State what the elements, states, objects, or observations are: the typed operating systems carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the virtual page and process, residency and page-table state, access and page fault, backing-store location, frame allocation and replacement, load and translation update, instruction restart and locality and thrashing conditions are explicit independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of operating systems because they reuse the typed operating systems carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, A page-table entry marks a page nonresident, hardware traps its first access, the operating system obtains a frame and loads the page, updates translation state and resumes the faulting instruction., and type the carrier, state every parameter and convention in the definition, test that the virtual page and process, residency and page-table state, access and page fault, backing-store location, frame allocation and replacement, load and translation update, instruction restart and locality and thrashing conditions are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Demand paging Domain-specific
Parents (1) — more general patterns this builds on
-
Demand paging is a kind of Lazy Evaluation Prime
The proposed strict upward parent is
prime:lazy_evaluation.
Hierarchy paths (2) — routes to 2 parentless roots
- Demand paging → Lazy Evaluation → Postponement → Optionality → Reversibility and Irreversibility
- Demand paging → Lazy Evaluation → Postponement → Optionality → Uncertainty
Neighborhood in Abstraction Space¶
Demand paging sits in a crowded region of the domain-specific corpus (16th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Operating Systems, Processes & Storage (18 abstractions)
Nearest neighbors
- System image — 0.94
- Virtual address space — 0.93
- Process state — 0.93
- Unique set size — 0.92
- 2 GB limit — 0.91
Computed from structural-signature embeddings · 2026-09-08