ConceptEngineering
Temporal locality
The principle that if you access an address, you are very likely in the near future to access it again.
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
4Each in their own terms, from the easiest level.
Onur Mutlu
The principle that if you just did something or referenced a memory location, it is very likely that you will do the same thing again soon.Frans Kaashoek
The principle that data accessed recently is likely to be accessed again in the near future.Kayvon Fatahalian & Kunle Olukotun
Repeated accesses to the same address result in hits.Erik Demaine
Reusing existing blocks in the cache as much as possible by accessing them again fairly soon.
Lectures that assume it
2Connections
13The lectures that define it or assume it, and the concepts next to it.
Concepts5
Lectures8
- Cache-Oblivious Algorithms: Medians and Matrices
- Memory Organization, Technology, Hierarchy & Caches (ETH Zürich, Digital Design and Computer Architecture, Lecture 21)
- File Systems
- Caches (Digital Design and Computer Architecture, ETH Zürich, Spring 2025, Lecture 22)
- Digital Design and Computer Architecture: Problem Solving VI (ETH Zürich, Spring 2025, Lecture 31)
- Parallel Computing: Why Parallelism? Why Efficiency?