The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+13 votes
909 views

Which of the following page replacement algorithms suffers from Belady’s anamoly?

  1. Optimal replacement

  2. LRU

  3. FIFO

  4. Both (A) and (C)

asked in Operating System by Veteran (59.5k points)
edited by | 909 views
0

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

2 Answers

+13 votes
Best answer

Answer is (C).

FIFO sufferes from Belady's anomaly. Optimal replacement never suffers from Belady's anomaly.

answered by Loyal (8.2k points)
edited by
+6 votes
Answer : C) FIFO

How/Why?
Page Replacement algorithms suffer from Belady’s anamoly if :

  • They do not follow the stack based algorithm.

Reference :-

Since LRU & Optimal Replacement Algo follow Stack Algo, hence they are not affected by Belady's Anamoly.

answered by Active (1.4k points)
edited by

Related questions



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

39,848 questions
46,815 answers
141,152 comments
59,065 users