Paging and Page Tables
The virtual-address split, the four- or five-level radix tree that maps it, and the PTE bits that carry protection, presence and dirty state.
TLB
How a small translation cache turns a four-level walk into one lookup, why its reach matters more than its hit rate, and what a shootdown really costs.
Page Faults and Working Set
Fault classes and their costs, the kernel path that fills a missing PTE, and why the working set rather than RSS decides whether memory is enough.
Virtualization Support
Root and non-root CPU modes, two-dimensional paging with EPT or NPT, and the exit and nested-walk costs that set a guest apart from bare metal.