Optimal Page Replacement
Result of Belady’s anmoly was the search for an
optimal page replacement algorithm, which has the lowest page fault rate of all
algorithms and never suffer from Belady’s anamoly.
This algorithm is simple: "Replace the page
that will not be used for the longest time in the future."
Optimal replacement is better than FIFO algorithm.
Unfortunately the optimal page replacement algorithm is difficult to implement
because it requires future knowledge of the reference string. The optimal page
replacement algorithm is used mainly for comparison studies.
No comments:
Post a Comment