Second-Chance

• FIFO replacement, but …

  • Get first in FIFO
  • Look at reference bit
    • bit == 0 then replace
    • bit == 1 then set bit = 0, get next in FIFO

• If page referenced enough, never replaced

• Implement with circular queue

Previous slide

Next slide

Back to first slide

View graphic version