liveBook · Manning

Memory page

A memory page is a fixed-size block of virtual or physical memory or storage that is managed and mapped as a unit.

How 2 Manning books explain it

Rust in Action: Systems programming concepts and techniques

A page is a fixed-size block of virtual memory that is mapped as a unit to physical memory or secondary storage.

How it is used
Explains how virtual memory is organized while motivating inspection of a running program’s values.
How deep it goes
Defines page size and explains mapping efficiency, fragmentation, caching, and swapping without detailing page-table layouts.
Examples
Uses running-program value inspection as motivation and contrasts page-based translation with mapping every variable separately.
What you can do after
Evaluate/understand it by explaining why address translation groups memory into pages and why an inactive page may reside on disk.

Read how Rust in Action: Systems programming concepts and techniques explains memory page →

Latency

A page is a fixed-size block of virtual memory that the operating system maps independently to physical memory or storage.

How it is used
Explains how operating systems provide virtual memory while controlling physical allocation, placement, and storage residency.
How deep it goes
Defines page granularity, page tables, demand paging, faults, and swapping, but defers application controls to a later treatment.
Examples
Uses 4 KiB and 2 MiB pages, noncontiguous address mappings, process regions, and disk-backed pages as concrete examples.
What you can do after
Evaluate memory-access latency by relating virtual-page access to physical allocation, page faults, and disk residency.

Read how Latency explains memory page →

Related concepts

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.