Question: Consider a 2-way associative cache with 8 cache blocks and the following sequence of memory block requests: 4,3,25,8,19,6,25,8,16,35,45,22,8,3,16,25,7 if LRU replacement policy is used, which
Consider a 2-way associative cache with 8 cache blocks and the following sequence of memory block requests: 4,3,25,8,19,6,25,8,16,35,45,22,8,3,16,25,7 if LRU replacement policy is used, which cache block will have page of memory block 7? how many cache miss? how many cache hit? (Assume initially cache memory is empty) Show your process
Step by Step Solution
There are 3 Steps involved in it
To solve this problem we have a 2way associative cache with 8 cache blocks which means there are 4 sets since 8 divided by 2 equals 4 Initially the ca... View full answer
Get step-by-step solutions from verified subject matter experts
