Which is the best page replacement algorithm and
why? How much time is spent usually in each phases and
why?
- 3 Answers
- 13616 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
Define trashing?
What is a critical section?
What is crpc in law?
Page replacement algorithm in Operating System?
How do I remove a second operating system from my computer?
How to setup never expired user password?
Explain trashing?
Briefly explain FCFS.
Define die threading and tapping.
How much ram do I need laptop?
What is short term scheduler in operating system (os)?
What are the different raid levels?
What is lts in node js?
How do you sleep in python?
What causes a page fault?
