How Virtual Memory and Paging Transform Linux Memory Management

Memory

Memory is the main storage of a computer, providing a linear address space where each byte is identified by a memory address, typically shown in hexadecimal (e.g., 0x00000003). The address space size is limited by the width of the address bus; a 32‑bit CPU can address from 0x00000000 to 0xFFFFFFFF.

RAM (Random Access Memory) offers random‑access capability, meaning access time is independent of the data’s location, which is essential for predictable process execution.

Memory is volatile; data disappears when power is lost, so persistent storage such as disks is still required.

Virtual Memory

Processes cannot directly access physical memory; they operate on virtual memory addresses that the operating system translates to real addresses. Each process has its own virtual address space, allowing independent addressing and isolation.

Virtual addresses can be mapped to the same physical memory region, enabling shared libraries and kernel data without copying.

int v = 0; printf("%p", (void *)&v);

Memory Paging

To avoid storing a mapping for every byte, Linux uses paging, dividing memory into fixed‑size pages (commonly 4 KB). The command $ getconf PAGE_SIZE returns 4096, the size of one page.

Paging reduces the number of mapping entries by a factor of 4096, as only page‑level mappings are needed. Each page’s offset (the lower 12 bits of an address) remains the same between virtual and physical pages.

Multi‑Level Page Tables

Linux stores page‑table entries in a hierarchical structure to save space. A two‑level page table splits the virtual page number into a high‑order part (first level) and a low‑order part (second level). The first‑level entry points to a second‑level table that contains the actual physical page mappings.

This design is analogous to a telephone directory with area codes; unused high‑order entries can be left empty, reducing memory consumption. Modern Linux kernels use up to three levels.

In summary, Linux manages memory by paging, separating virtual and physical addresses, and using multi‑level page tables to provide efficient, isolated, and secure memory access for processes.