Interested to Buy Any Domain ? << Click Here >> for more details...
Which is the best page replacement algorithm and Why ?
- 5 Answers
- 38768 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
When does stack (process stack) overflow? What are the remedies?
How do I go to a specific line in vi?
What do you mean by parallel processing?
Why do we use semaphore?
Can I delete the program files x86?
How do I cd into a directory?
How much ram can a 32 bit os use?
What are threads in OS?
Can I have two browsers on my computer?
Tell me the difference between yielding and sleeping?
Which is the best operating system in the world?
What is a sector?
What do you understand by system clock? What is system unit?
Is 4gb ram enough for netflix?
What do you mean by semaphore?
