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
What is sudo user?
How do I know 64 bit?
What is the function of the control lines in ram?
What are numerous ways in which a thread can enter the waiting state?
What is the cache memory?
How do I cd into a directory?
Explain thrashing.
What is ecc in reference to ram?
What is normal operating system?
Does direct memory manipulation is an unsafe operations, if yes, how?
What is asynchronous task?
What is ram parity?
What are the functions of the ram ic`s?
What is a virtual memory?
What are the advantages of a multiprocessor system?