2 nd chance FIFO replacement algorithm  May be implemented by using a queue  FIFO: oldest page may be most referenced page  An improvement: second chance FIFO o Inspect pages from oldest to newest o If page s referenced bit is on, give it a second chance:  Clear bit  Move it to end of queue o Else  Remove page  Second chance FIFO can be implemented more efficiently as a circular queue: the clock algorithm 17 Operating Systems, 2014, Meni Adler, Danny Hendler and Amnon Meisels
{}