Sign inSign in
ConceptSystems & CS

Cache-oblivious algorithm

An algorithm designed to exploit the memory hierarchy without knowing the block size B or the cache size M.
as Erik Demaine defines itMITThe 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.

Lecturers

3

Each in their own terms, from the easiest level.

  • Julian Shun

    MIT · Undergraduate

    An algorithm designed to perform well on a cache without needing to know the cache's specific parameters like size or block size.
    • 1:13:51Caching and Cache-Efficient Algorithms
    • 0:43Cache-Oblivious Algorithms
  • Erik Demaine

    MIT · Undergraduate

    • 38:39Topics in Algorithms Research
  • Tim Mattson

    Intel · Undergraduate

    An algorithm designed to exploit the memory hierarchy without explicitly knowing the cache size.
    • 1:31:10Introduction to Parallel Programming with OpenMP (Part 3)

Connections

7

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

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