Skip to content
Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

set-associative cache

A cache in which each memory line can go in any of a few slots that form a group, so two busy lines with the same index no longer have to throw each other out.

An N-way set-associative cache groups its lines into sets of N; the index selects a set, the tags of all N ways are compared in parallel, and a block may be placed in any way of its set. Typical L1 data caches are 8- to 12-way.

Read the full section →