Sign inSign in
ConceptEngineering

Spatial locality

Accessing memory locations close to recently accessed locations.
as Onur Mutlu defines itETH ZürichThe wording closest to all 5 definitions
Watch it explained

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

4

Each in their own terms, from the easiest level.

  • Onur Mutlu

    ETH Zürich · Undergraduate

    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.
    • 1:22:06Memory Organization, Technology, Hierarchy & Caches (ETH Zürich, Digital Design and Computer Architecture, Lecture 21)
  • Julian Shun

    MIT · Undergraduate

    The property of an algorithm that accesses memory locations close to each other, allowing for efficient cache usage.
    • 49:54Caching and Cache-Efficient Algorithms
  • Kayvon Fatahalian & Kunle Olukotun

    Stanford University · Undergraduate

    Loading data in a cache line preloads the data needed for subsequent accesses to different addresses in the same line, leading to cache hits.
    • 1:11:25Parallel Computing: Why Parallelism? Why Efficiency?
  • Erik Demaine

    MIT · Graduate

    Structuring data access so that when one element is accessed, nearby elements are also accessed.
    • 10:52Cache-Oblivious Algorithms: Medians and Matrices

Connections

11

The lectures that define it or assume it, and the concepts next to it.

4 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.