ConceptSystems & CS
Cache block
The smallest unit of data that can be transferred between memory and cache.
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.
Memory addressing1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
7- Problem Solving V: Digital Design and Computer Architecture (ETH Zürich, Spring 2025, Lecture 30)
- Cache-Oblivious Structures I
- 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)
- Digital Design and Computer Architecture: Problem Solving II (ETH Zürich, Spring 2025, Lecture 27)
- Digital Design and Computer Architecture: Problem Solving III (ETH Zürich, Lecture 28)
- Digital Design and Computer Architecture: Problem Solving VI (ETH Zürich, Spring 2025, Lecture 31)
Connections
13The lectures that define it or assume it, and the concepts next to it.
Lectures8
- Caching and Cache-Efficient Algorithms
- Problem Solving V: Digital Design and Computer Architecture (ETH Zürich, Spring 2025, Lecture 30)
- Cache-Oblivious Structures I
- 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)
- Digital Design and Computer Architecture: Problem Solving II (ETH Zürich, Spring 2025, Lecture 27)