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 grep means?
What is Direct Access Method?
What is the use of paging in operating system?
What is the cause of thrashing?
Can I delete the program files x86?
Explain the key object oriented concepts used by windows nt?
How long should a chkdsk take?
What is lxde desktop?
Does uninstalling a program delete it?
Can you have both 32 bit and 64 bit excel?
What does echo $$ do?
How do I upgrade my excel to 64 bit?
Why is interrupt vector used in operating systems?
Can I use ie with google chrome?
How do I unhide a file?