Question: Prove that in a two-level cache hierarchy, where L1 is closer to the processor, inclusion is maintained with no extra action if L2 has at
Prove that in a two-level cache hierarchy, where L1 is closer to the processor, inclusion is maintained with no extra action if L2 has at least as much associativity as L1, both caches use line replaceable unit (LRU) replacement, and both caches have the same block sizes.
Step by Step Solution
3.41 Rating (164 Votes )
There are 3 Steps involved in it
Inclusion states that each higher level of cache contains all the values present in the lower cache ... View full answer
Get step-by-step solutions from verified subject matter experts
