Consider the following representative page address trace generated by a two-level cache memory scheme that uses demand paging and has a main-memory capacity of four pages: 1 6 4 5 1 4 3 2 1 2 1 4 6 7 4.

Which of the page replacement policies FIFO or LRU is more suitable for use with this system?

Representative Page Address Trace = 1, 6, 4, 5, 1, 4, 3, 2, 1, 2, 1, 4, 6, 7, 4.

Capacity of Main Memory = 4

Let's find out which Page Replacement Policy performs great in the above-mentioned system.

FIFO Page Replacement Policy -

Page Fault = 10

Page Hits = 5

LRU Page Replacement Policy -

Page Fault = 8

Page Hits = 7

• Based on the number of page faults and the number of page hits we can find out which page replacement policy is the best suitable for the given system.
• The number of page faults in the LRU is lesser than the number of page faults in the FIFO.

$$Page \ Faults \ of \ FIFO \gt Page \ Faults \ of \ LRU$$

$$10 \gt 8$$

• The number of page hits in the LRU has more page hits than in the FIFO.

$$Page \ Hits \ of \ FIFO \lt Page \ Hits \ of \ LRU$$

$$5 \lt 7$$

This shows that LRU Page Replacement is the Best Suitable Policy for the given system.