P337
When a page is selected and its value is 0, we replace this page, but if the reference bit is set to 1, we give the page a second chance and move on to select the next FIFO page. When a page gets a second chance, its reference bit is cleared, and its arrival time is reset to current time. One way to implement the second-chance algorithm is as a circular queue.a pointer indicates which page is to be replaced next. when a frame is needed the pointer advances until it finds a page which a