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?

GATE : Computer Science and IT

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

D. FIFO (First In First Out)

Explanation

If page fault rate increases even when the number of allocated frames increases, then that situation is called “Belady’s Anamoly”. It was happening with only FIFO among the given options.