What Happens After a Cache Miss
The lesson starts with a load instruction and follows its virtual address through translation and cache-tag lookup. On a miss, a layered animation shows the request moving to lower cache levels or the memory system, with a branch for a coherent copy held by another core.
The narration explains cache lines and locality, then contrasts a sequential scan with a dependent pointer chain. It avoids fixed latency claims and uses a cache simulator to make access patterns visible. Companion material: data-movement article, cache-miss trace, and the CS:APP Cache Lab.
Related articles
Data Movement Is the Hidden Cost in CPU Work
Follow an instruction through a pipelined processor and explain why cache locality often matters more than operation count.
Scheduling: How the OS Chooses What Runs Next
CPU scheduling algorithms from first-come-first-served to modern multi-level feedback queues and the Completely Fair Scheduler.
Arrays and Memory: How Indexing Works
Why array indexing is O(1), how the CPU computes element addresses, and what spatial locality means for performance.
New lessons by email
Get new articles and notes on the systems behind everyday software.
One technical dispatch per week. No noise.
Not started
Sign in to save your learning progress.