Which is the best page replacement algorithm and Why ?
- 5 Answers
- 36859 Views
- Honeywell, Intel, TCS, I also Faced
- E-Mail Answers
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
Does android run on x86?
Which is better chkdsk r or f?
What is trcd timing?
Can I upgrade my cpu from 32 to 64 bit?
Define Operating System Types.
What are the 7 layers of networking?
Explain Round Robin.
What is dual-mode operation?
What is the ie tab in google chrome?
Can you fix blue screen of death?
Does direct memory manipulation is an unsafe operations, if yes, how?
What is virtual memory? Where it used by OS?
What do you understand by multi-threading and multi-tasking?
Explain what you mean by memory alignment.
Considering notepad/IE or any other thing as process, What will happen if you start notepad or IE 3 times ? Where three processes are started or three threads are started?
