Sign inSign in
ConceptEngineering

Set-associative cache

A cache organization where each memory address can be placed in any of a fixed number of blocks within a specific set.
as Onur Mutlu defines itETH ZürichThe wording closest to all 3 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

2

Each in their own terms, from the easiest level.

  • Onur Mutlu

    ETH Zürich · Undergraduate

    A cache organization where an address maps to a specific set, and within that set, any block location can be used.
    • 17:35Caches (Digital Design and Computer Architecture, ETH Zürich, Spring 2025, Lecture 22)
  • Julian Shun

    MIT · Undergraduate

    A cache design where the cache is divided into sets, and each set contains multiple lines, allowing a memory block to be placed in any of the lines within its assigned set.
    • 11:58Caching and Cache-Efficient Algorithms

Lectures that assume it

3

Connections

14

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

2 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.