Sign inSign in

Tall-cache assumption

The assumption that cache size MM is at least B2B^2, meaning the cache is taller than it is wide.
as Erik Demaine defines itMITThe wording closest to all 4 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.

  • Erik Demaine

    MIT · Undergraduate

    The assumption that the cache size M is at least the block size B raised to 1 plus epsilon, ensuring multiple blocks fit in cache.
    • 52:16Cache-Oblivious Structures I
    • 54:56History of Memory Models
  • Julian Shun

    MIT · Undergraduate

    An assumption that the cache is taller than it is wide, expressed as B2<cMB^2 < cM for a constant c, meaning the number of cache lines M/B is greater than the cache line size B.
    • 36:40Caching and Cache-Efficient Algorithms

Connections

10

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.