1,157 views
0 0 votes

1 Answer

0 0 votes

Lets go step by step.

1) First access: 0

   I generated miss.ok, fine.

2) 2nd access: 2

   It was hit.

   Now, observed closely the options. In option A, block size=2. If this was the case, this would have generated a miss.

   So, option A is eliminated.

 3) 3rd access: 4

     It generated a miss. Now, consider option B. If block size=128, then this should have been a hit.

     So, option B eliminated.

     Now, we prove that option C is also wrong. OPtion (C) says that in single set, there can 128 blocks with BS=4bytes (which            says cache is greater than M.M. Quite possible, atleast hypothetically!).

      So, a block, once brought in would always generate a hit. But we see that access to address 0 (i.e. 3rd last zero) is a miss.

      So, option C also eliminated.

Position:
Show:

Related questions

1 1 vote
1 1 answer
134
134 views
DΛΞMON asked Sep 28
134 views
$\begin{array}{l}\textbf{Q. } \text{A processor has the cache hierarchy as given. Assume that 20\% of instructions are}\\\text{load/store instructions. The remaining 80\%...
2 2 votes
1 1 answer
177
177 views
naveendewangan asked Aug 2
177 views
Assume 15% of L1 misses are resolved in the victim cache. If retrieving data from the victim cache takes 4 cycles and retrieving data from main memory take 50 cycles, by ...
1 1 vote
1 1 answer
237
237 views
Ultra_Instinct_AM asked Jan 7
237 views
A processor has a base CPI of 1.2. Every instruction requires one instruction fetch, and 30% of instructions are loads and 10% are stores.The L1 cache miss rate (same for...