Which is the best page replacement algorithm and Why ?
Answer Posted / pravin tripathi
optimal page replacement algorithm seems to be the best page
replacement algorithm as"the no. of page faults are minimum
as compared to any page replacement algorithm as well as it
is free from belady's anomaly",but the problem is that,it is
very difficult to implement as it need the future knowledge
of reference string.
while least-recently-used(LRU)algorithm is also free
from belady's anamoly and the no. of page faults are fewer
than any other page repl. algorithm(besides OPT algorithm)
it is easy to implement.and is the best page replacement
algorithm.
| Is This Answer Correct ? | 98 Yes | 9 No |
Post New Answer View All Answers
What is ram parity?
What are the different types of semaphores?
Describe system calls and its type
How do I run chkdsk on external drive?
How do I know if my cpu is overheating?
What command is used to remove the password assigned to a group?
What is the difference between shared memory and distributed memory?
How are data structures handled by ntfs?
List the possible threads a thread can have?
Can you have both 32 bit and 64 bit excel?
Explain mutant in operating system (os)?
What is the main purpose of an operating system?
Does deleting all files uninstall a program?
What's the difference between 32 and 64 bit?
How do I know chkdsk is finished?