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.
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
1Connections
3The lectures that define it or assume it, and the concepts next to it.