Called block block Cache block 0 counter block Cache block 1 counter block Cache block 2 counter block Cache block 3 counter block Cache block counter Cache block block • counter Cache block block 1...

1. 
   The following blocks are referenced by the CPU and to be fetched from the RAM to the cache sequentially:
   
   

(i   j    k    L   L   j  m j   n    L    m    j    m    L    k    S    j    P    i    O  k)

Assume that the cache set is empty and all the above blocks can be inserted into the set.

Use the LRU algorithm to fill in the following table that describes the status of the cache locations for each called block.

Extracted text: Called block block Cache block 0 counter block Cache block 1 counter block Cache block 2 counter block Cache block 3 counter block Cache block counter Cache block block • counter Cache block block 1 counter Cache block block Y counter Hit or Fail