PPT Slide
Page Replacement Algorithms
- Optimal (aka MIN or OPT): Replace the page that is to be used the farthest in the future.
- Not an actual algorithm, since it requires future knowledge.
- Useful benchmark, though, for testing other algorithms.
- Provides a lower bound on page faults.
- Example of it’s use later.
- Random: Replace a random page.
- Does not attempt to predict future behavior based on the past.
- Easy to implement :)
- Not the worst, but not the best. Consider it a lower bound on page replacement algorithms.
- Example of it’s use later (Figure 12.1).