Page Replacement Algorithms

Basic Page Replacement Algorithms

Optimal Algorithm

Least Recently Used (LRU)

First In First Out (FIFO)

Clock Policy Algorithm

Advanced Page Replacement Algorithms

Working Set Strategy


Page Fault Frequency

Variable-Interval Sampled Working Set (VSWS)

External Links


  1. Theoretically the best page replacement algorithm is
    1. Optimal algorithm
    2. Least Recently Used(LRU)
    3. First In First Out(FIFO)
    4. Clock Policy Algorithm
  2. Clock Algorithm outperforms FIFO algorithm in cases where
    1. All pages are equally likely to be referenced
    2. Certain pages are referenced more often than the others
    3. Some pages are never referenced
    4. None of the above
  3. We can find the page having the longest time to replace by using
    1. Optimal Algorithm
    2. Working Set Strategy Algorithm
    3. It is not possible to find the time to replacement for a page
    4. None of the above

1. a; 2. b; 3. c;