About this episode
Page tables provide the mapping between virtual memory and physical memory for each process. This means it needs to be as efficient and as fast as possible. I explore the inner workings of page tables in this episode.
- 0:00 Intro
- 2:00 Virtual Memory
⁃ ⁃ 8:00 MMU
- 10:00 Page Tables
⁃ ⁃ ⁃ ⁃ ⁃ ⁃ ⁃ 11:30 Single Table Byte Addressability
⁃ ⁃ ⁃ ⁃ ⁃ ⁃ ⁃ ⁃ 16:00 Single Table Page addressability
⁃ ⁃ ⁃ ⁃ ⁃ 19:00 Multi-level Paging (Radix tree)
⁃ ⁃ 31:00 Huge Tables
⁃ ⁃ 33:00 TLB
⁃ ⁃ Summary
Get every episode summarized
Each time The Backend Engineering Show with Hussein Nasser publishes, we email you a written briefing from the transcript — the topics, who appeared, and any specific claims, with the ad reads skipped.
Email me new episodesFree for 3 shows. No card needed.
Hosts & guests
No transcript yet
This episode has not been transcribed. Request it and it moves to the front of the queue.
More episodes
More from The Backend Engineering Show with Hussein Nasser
Caching is a cop-out
The Backend Engineering Show with Hussein Nasser
How open ai agents "hacked" hugging face
The Backend Engineering Show with Hussein Nasser
How a query optimization gave birth to infinite scroll
The Backend Engineering Show with Hussein Nasser
Postgres is half as fast in Linux 7.0
The Backend Engineering Show with Hussein Nasser