Which is the best page replacement algorithm and
why? How much time is spent usually in each phases and
why?
- 3 Answers
- 12946 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
What is storage management in operating system?
Under what circumstances do page faults occur?
How do I know if my ram is corrupted?
Explain what is meant by heap?
What is short term scheduler in operating system (os)?
How can I run 32 bit on 64 bit?
Have you used threaded trees anytime in your life time?
Can you please explain the difference between trap and trapdoor?
How much cpu usage is normal?
What are necessary conditions for dead lock?
What are the three conditions that must be present for deadlock to be possible?
How many types of os are there?
What replaced ifconfig?
How long does chkdsk last?
How does agile communication differ from tradition software engineering communication? How it is similar?
