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
- 14214 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
Where are the global variables stored?
Explain the concept of deadlocks? Why they are used?
Can I have two browsers on my computer?
Do I install 32 bit or 64 bit office?
Who is the father of os?
What are the 3 types of operating systems?
What causes a page fault?
Difference between a thread and process?
How do I remove prime os from my pc?
What is a boot-strap program?
Do you know what is a binary semaphore? What is its use?
Give a non-computer example of preemptive and non-preemptive scheduling?
How do I find the path to a file?
Can you list the coffman's conditions that lead to a deadlock?
What is risc technology?
