ConceptEngineering
Spatial locality
Accessing memory locations close to recently accessed locations.
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 did something or referenced a memory location, you are likely to do something similar or related in nearby space or addresses.Julian Shun
The property of an algorithm that accesses memory locations close to each other, allowing for efficient cache usage.Kayvon Fatahalian & Kunle Olukotun
Loading data in a cache line preloads the data needed for subsequent accesses to different addresses in the same line, leading to cache hits.Erik Demaine
Structuring data access so that when one element is accessed, nearby elements are also accessed.
Connections
11The lectures that define it or assume it, and the concepts next to it.
Lectures5
- Caching and Cache-Efficient Algorithms
- Cache-Oblivious Algorithms: Medians and Matrices
- Memory Organization, Technology, Hierarchy & Caches (ETH Zürich, Digital Design and Computer Architecture, Lecture 21)
- Digital Design and Computer Architecture: Problem Solving VI (ETH Zürich, Spring 2025, Lecture 31)
- Parallel Computing: Why Parallelism? Why Efficiency?