Sign inSign in
ConceptSystems & CS

Cache-oblivious stencil computation

A recursive divide-and-conquer approach that traverses trapezoidal regions in space-time to optimize cache locality without knowing cache parameters.
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.

Cache behavior of looping1Divide and conquer algorithm1

Lecturers

1

    Connections

    2

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

    Concept1

    Lecture1

    1 lecturer. 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.