Find the no of hits and misses in a 4-blocked cache For the LIFO policy

Question

, if the sequence of blocks refered by cpu is given as 1,3,5,6,7,1,5,4.

Comments

6 miss

2 hit

---

please can u explain

---

The block arrangement manner i.e. direct , associative or set associaitve should also be mentioned as the answer will vary in each case

Answer 1

LIFO policy is the property of stack. If we want to replace any block, then we have to remove the block which is referred last.

The cache is 4-blocked & initially empty. So first 4 blocks are all different. No hits. All misses.

Total Hits = 0, Total Misses = 4

(Referred first) 1 3 5 6(last referred)

Next block is 7. It is a miss. So now we should replace 6 with 7.

Total Hits = 0, Total Misses = 5

(Referred first) 1 3 5 7(last referred)

Next 2 blocks are already present in the cache. So no need for replacement.

Total Hits = 2, Total Misses = 5

Last block is 4. Its a miss. So we can replace 7 with 4.

Total Hits = 2, Total Misses = 6

(Referred first) 1 3 5 4(last referred)

Comments

@vamsi how u know that LIFO page replacement policy is implemented here and  cache is 4-blocked .

---

it is in question title.

---

ok...