Sign inSign in
ConceptSystems & CS

Cache-miss lemma

A lemma stating that if a program reads r data segments with total size N, where N < M/3 and the average segment size N/r is at least the cache line size B, then the segments fit in cache and incur at most 3N/B cache misses.
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

    4

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

    Concepts3

    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.