OPTIMAL PAGE REPLACEMENT ALGORITHM

• has the lowest page fault rate of all algorithms.
• this is the best case
• can use it to compare other algorithms against
• Replace the page that won’t be needed for the longest time in the future.
• Belady's optimal algorithm for the minimum number of page faults
• replace the page that will be referenced furthest in the future or not at all
• problem: we cannot implement it, because we cannot predict the future of the reference string.