ConceptEngineering
Set-associative cache
A cache organization where each memory address can be placed in any of a fixed number of blocks within a specific set.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Onur Mutlu
A cache organization where an address maps to a specific set, and within that set, any block location can be used.Julian Shun
A cache design where the cache is divided into sets, and each set contains multiple lines, allowing a memory block to be placed in any of the lines within its assigned set.
Lectures that assume it
3Connections
14The lectures that define it or assume it, and the concepts next to it.
Concepts8
- Direct-mapped cache
- Fully associative cache
- Cache
- Cache associativity
- Conflict miss
- Approximations of LRU
Show 2 moreShow fewer
Lectures6
- Caching and Cache-Efficient Algorithms
- Caches (Digital Design and Computer Architecture, ETH Zürich, Spring 2025, Lecture 22)
- Digital Design and Computer Architecture: Problem Solving IV (ETH Zürich, Spring 2025, Lecture 29)
- Problem Solving V: Digital Design and Computer Architecture (ETH Zürich, Spring 2025, Lecture 30)
- Digital Design and Computer Architecture: Problem Solving III (ETH Zürich, Lecture 28)
- Caches II and Prefetching (ETH Zürich, Digital Design and Computer Architecture, Lecture 23)