Which is the best page replacement algorithm and
why? How much time is spent usually in each phases and
why?
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
Can two different ram speed modules be used together?
What is a 32 bit system?
How do I know chkdsk is finished?
What is time slice?
What are dynamic loading?
Is it ok to interrupt chkdsk?
Explain bootstrap program in operating system.
What is the current microsoft operating system?
How does yahoo handles billions of requests, does it create a thread per request or a process?
How do I stop chkdsk at startup?
Describe Inter Machine Communication?
How do I find a file path on a mac?
How do I clean up program files?
What is banker's algorithm?
What are the different operating systems?