Interested to Buy Any Domain ? << Click Here >> for more details...
Which is the best page replacement algorithm and Why ?
- 5 Answers
- 38782 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 do I go to a specific line in vi?
Does 64 bit use more ram?
What is the difference between shared memory and distributed memory?
Define max, min heap and search time of heap.
Throw some light on internal process memory.
What is tcl timing?
Do I need 32gb of ram?
What is option in grep?
What are various scheduling queues?
What is waiting time?
Does 64bit mean 64bit?
In a ram description ddr 2 1066mhz “2.5-3-3-8” what do the numbers in quotes signify?
Who is the father of operating system?
Tell me about different OS related issues for a given set of C-programs (mainly address issues address space, paging etc.)
Can you move program files from c to d?
