GATE - 2016 | OS | In which one of the following page replacement algorithms it is possible

GATE - 2016 [Operating System]

Question:

In which one of the following page replacement algorithms it is possible for the page fault rate to increase even when the number of allocated frames increases?

A	LRU (Least Recently Used)
B	OPT (Optimal Page Replacement)
C	MRU (Most Recently Used)
D	FIFO (First In First Out)

  

Solution:

Option (D) is Correct.

To answer the question you have to know about Belady’s anomaly.
In Belady’s anomaly is the phenomenon in which increasing the number of page frames results in an increase in the number of page faults for certain memory access patterns proves that it is possible to have more page faults when increasing the number of page frames while using the First in First Out (FIFO) page replacement algorithm.
In some situations, FIFO page replacement gives more page faults when increasing the number of page frames.

Thank You