|
|
| The Optimal Replacement |
|
| Algorithm |
|
|
|
|
|
|
|
|
|
| ä | Replace
the page that will take the longest time |
||||||
| to be
referenced again. |
|||||||
| ä | It is
the best page replacement algorithm |
||||||
| ä | Impossible
to implement. |
||||||
| ä | Can
be used to measure how effective other |
||||||
| scheduling
algorithms are. |
|||||||
