Sign inSign in
ConceptSystems & CS

Cilk and caching theorem

A theorem stating that the number of cache misses in a parallel Cilk computation is the serial cache misses plus a term proportional to the number of successful steals.
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

1

    Connections

    3

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

    Concepts2

    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.