Optimal Page Replacement Algorithm - Operating System

Q.  Which page is selected by the Optimal Page Replacement Algorithm?
- Published on 27 Aug 15

a. The page that has been used for maximum.
b. The page that has been used minimum.
c. The page that has not been used for the longest time in the past.
d. The page that will not be used for the longest time in the future.

ANSWER: The page that will not be used for the longest time in the future.

Related Content

 

    Discussion

  • Nirja Shah   -Posted on 12 Nov 15
    Optimal Algorithm
    - This algorithm produces the lowest page fault rate of all algorithms.

    - This algorithm is used to replace the page that will not be used for the longest period of time to come.

    - Given a fixed number of memory frame by allocation, the algorithm always guarantees the lowest possible page fault rate and also does not suffer from Belady's anomaly.

    - Replace the page that will not be used for the longest period of time in future.

    - The implementation of this algorithm is very difficult since it requires knowledge of the future memory references.

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲