Interested to Buy Any Domain ? << Click Here >> for more details...
Which is the best page replacement algorithm and
why? How much time is spent usually in each phases and
why?
- 3 Answers
- 14474 Views
- I also Faced
- E-Mail Answers
Answer Posted / manu pai m
What is the criteria for the best page replacement algorithm?
1. It should be good in predicting which page wouldn't be
needed for the maximum amount of time, so that it can be
selected as the victim and swapped onto the disk.
2. It should use minimal resources (in terms of computation
and memory) to identify the victim.
There are a number of algorithms suggested including Random,
Least recently used, First chance algorithm etc. First
chance looks to be the best algorithm according to me.
| Is This Answer Correct ? | 11 Yes | 4 No |
Post New Answer View All Answers
Explain latency, transfer and seek time with respect to disk i/o.?
What is the operating system?
What are loosely coupled systems?
Explain what are device drivers used for?
Given a Pid, how will you distinguish whether it is a process or a thread?
When would you choose Top-down methodology?
Tell me the difference between yielding and sleeping?
Explain how a copying garbage collector works.
What is interprocess communication in os?
What are distributed systems?
What is the difference between soft and hard links?
How do I tell if excel 2016 is 32 or 64 bit?
What happens if you install 64 bit on 32?
Under what circumstances do page faults occur? Describe the actions taken by the operating system when a page fault occurs?
What is a monitor?
