Sign inSign in
ConceptEngineering

Temporal locality

The principle that if you access an address, you are very likely in the near future to access it again.
as Onur Mutlu defines itETH ZürichThe wording closest to all 6 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.

Cache2Cache design1Cache hits1Locality1Memory addresses1Memory hierarchies1Memory reference streams1Program execution1

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 just did something or referenced a memory location, it is very likely that you will do the same thing again soon.
    • 1:21:04Memory Organization, Technology, Hierarchy & Caches (ETH Zürich, Digital Design and Computer Architecture, Lecture 21)
    • 1:00:44Digital Design and Computer Architecture: Problem Solving VI (ETH Zürich, Spring 2025, Lecture 31)
  • Frans Kaashoek

    MIT · Undergraduate

    The principle that data accessed recently is likely to be accessed again in the near future.
  • Kayvon Fatahalian & Kunle Olukotun

    Stanford University · Undergraduate

    Repeated accesses to the same address result in hits.
    • 1:11:25Parallel Computing: Why Parallelism? Why Efficiency?
  • Erik Demaine

    MIT · Graduate

    Reusing existing blocks in the cache as much as possible by accessing them again fairly soon.
    • 11:45Cache-Oblivious Algorithms: Medians and Matrices

Lectures that assume it

2

Connections

13

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.