[prev] 52 [next]

Page Replacement (cont)

LRU is one replacement strategy. Others include:

First-in-first-out (FIFO)

  • page frames are entered into a queue when loaded
  • page replacement uses the frame from the front of the queue
Clock sweep
  • uses a reference bit for each frame, updated when page is used
  • maintains a circular list of allocated frames
  • uses a "clock hand" which iterates over page frame list
    • skipping and resetting reference bit in all referenced pages
  • page replacement uses first-found unreferenced frame