liveBook · Manning

Address space

An address space is the set or range of addresses recognized within a system or addressing scheme for identifying locations or entities.

How 3 Manning books explain it

Rust in Action: Systems programming concepts and techniques

An address space is the set of memory addresses available for identifying stored data and instructions in an execution environment.

How it is used
Uses address spaces to make pointer values intelligible and to investigate what memory a running process can access.
How deep it goes
Works from a byte-address model through virtual-memory terminology and hands-on inspection, while treating OS–CPU implementation details as a general guide.
Examples
Uses printed Rust pointer addresses, an illustrative 49-byte layout, failed byte-by-byte scans, and Windows memory-region inspection.
What you can do after
Apply it via the Windows API to inspect a process’s memory regions without blindly dereferencing addresses.

Read how Rust in Action: Systems programming concepts and techniques explains address space →

Latency

A process address space is the range of virtual memory addresses available to a running process.

How it is used
Explains how applications receive virtual memory and why address-space behavior affects application latency.
How deep it goes
Descends from process layout to page tables, lazy allocation, page faults, swapping, and memory-versus-disk access costs.
Examples
Uses process memory-layout and page-table figures, including contiguous virtual ranges mapped to noncontiguous physical locations.
What you can do after
Evaluate latency risks by relating page mappings, lazy allocation, and disk-backed pages to access cost.

Read how Latency explains address space →

Grokking Concurrency

An address space is the range and mapping of memory addresses available to a process or other execution context.

How it is used
Defines the memory view that lets processes hold data while remaining isolated from one another.
How deep it goes
Defines accessible process memory and contrasts separate process spaces with threads’ shared space; defers communication mechanisms.
Examples
Uses child processes with separate memory and threads reading and writing shared process memory.
What you can do after
Understand how separate or shared memory affects isolation and communication between processes and threads.

Read how Grokking Concurrency explains address space →

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.