Which of the following page replacement algorithms suffers from Belady’s anamoly?
Both (A) and (C)
Proof that LRU does not incur Belady’s anomaly but that FIFO does incur the anomaly: http://ranger.uta.edu/~weems/NOTES5314/HW/hw3.3.pdf
Answer is (C).
FIFO sufferes from Belady's anomaly. Optimal replacement never suffers from Belady's anomaly.
Page Replacement algorithms suffer from Belady’s anamoly if :
Since LRU & Optimal Replacement Algo follow Stack Algo, hence they are not affected by Belady's Anamoly.
Belady’s anomaly occurs in those page replacement algorithm which does not have a Stack Algorithm.
Stack Algorithm: It is observed that on increasing the number of frames, the page fault is going to decrease, But FIFO shows an exceptional behavior. This algorithm says that if some pages are present in a system with n number then they are definitely going to present in a system with the n+1 frame. But FIFO denies this and that is why Only FIFO suffers from Belady's Anomaly.
Can someone help me understand examples on...