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
- 14185 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 a virtual machine and how does it work?
What is git bash?
Explain segmentation with paging?
Why is it that a single, all – encompassing metric cannot be developed for programme complexity or programme quality?
What is live boot?
Does uninstalling a program delete it?
Explain translation lookaside buffer?
Does 64 bit use more ram?
What causes a page fault?
Describe the actions taken by the operating system when a page fault occurs?
What is operating system and type of operating system?
How do I know if my motherboard is 32 bit or 64 bit?
What happens if you install 64 bit on 32?
What is synchronization? What are the different synchronization mechanisms?
Differentiate between Multiprocessing, Mutliprogramming and Multithreading.
