Note

CS Degree Day 75

CS Degree in 100 Days

23 Aug'25

What I did today?

Lecture 10: Caches - locality, cache lines, associativity
Lecture 11: Cache miss types - compulsory, capacity, conflict
Problem set: Calculate hit rates for given access patterns

Registers - L1 cache - L2 cache - L3 cache - RAM - Disk. Each level is larger and slower. This explains why iterating over a 2D array row-first is faster than column-first in C. The cache is a detail that is not a detail.

Back to notes Return home