In Second chance Page replacement algorithm(clock algorithm), if all the Reference bits are set to one, then the algorithm behaves just as FIFO.
Considering this case, can we conclude that Second chance algorithm also suffers from Belady's anomaly?
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.
Sign up to join this communityIn Second chance Page replacement algorithm(clock algorithm), if all the Reference bits are set to one, then the algorithm behaves just as FIFO.
Considering this case, can we conclude that Second chance algorithm also suffers from Belady's anomaly?
This is not true. This is only a special case in once instance of 2nd chance algorithm. All reference bits set to one does not persist for each page that tested for a page replacement. Since LRU does not suffer from Belady's anomaly, and since 2nd chance is an approximation to LRU, then it follows that 2nd chance does not suffer from Belady's anomaly.