Which is the best page replacement algorithm and Why ?
- 5 Answers
- 36846 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
How can I run 32 bit on 64 bit?
Will chkdsk fix bad sectors?
What is sudo user?
why is the context switch overhead of a user-level threading as compared to the overhead for processes? Explain.
Does deleting all files uninstall a program?
How do I go to root?
Can x86 run 64 bit?
What are the methods for handling deadlocks?
Write a function that responds to a click anywhere on the page by displaying an alert dialog. Display the event name if the user held Shift during the mouse click. Display the element name that triggered the event if the user held Ctrl during the mouse click.
What are the functions of operating system?
In a ram description ddr 2 1066mhz “2.5-3-3-8” what do the numbers in quotes signify?
How do you kill pid?
Difference between a thread and process?
What are the differences between Real Time Operating System (RTOS) and General Purpose Operating Systems (GPOS)?
What does 64bit mean?
