|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| n | The Optimal policy selects for replacement |
||||||||||||||||
| the page for
which the time to the next |
|||||||||||||||||
| reference is
the longest |
|||||||||||||||||
| u | produces the
fewest number of page faults |
||||||||||||||||
| u | impossible to
implement (need to know the |
||||||||||||||||
| future) but
serves as a standard to compare |
|||||||||||||||||
| with the other
algorithms we shall study: |
|||||||||||||||||
| F | Least recently
used (LRU) |
||||||||||||||||
| F | First-in,
first-out (FIFO) |
||||||||||||||||
| F | Clock |
||||||||||||||||
