A page table lookup means an extra memory reference for every address, so hardware caches recent virtual‑to‑physical translations in a small, fully-associative cache called the translation-lookaside buffer. Follows the Paging: Faster Translations (TLBs) chapter of OSTEP (Chapter 19).
| slot | VPN |
|---|
One column per array access: green is a TLB hit, red is a miss.
One column per process switch. Same sequence of runs, two different TLB policies.
Reference row: the classic 17-reference worked example, replayed against a 3-entry TLB.
Keys: → next, ← back, space play or pause, 1–4 switch scenario.