© Thomas Kunz 2000
SCE 574
244
The Optimal
Replacement
Algorithm
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.