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
- 14307 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / 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 |
Answer / neha chauhan
Optimal page replacement algorithm is best page replacement
algorithm because in this algo we need to know about those
pages which would be used less frequently in futur and they
would be the victim pages to replace.
| Is This Answer Correct ? | 4 Yes | 1 No |
Answer / samir11
there are 3 different page replacement algorithms .they are
FIFO,LRU,OPTIMAL page replacement algorithm....out of them,
page replacement algorithm is the best one.,because here
there are less no. of page faults.
| Is This Answer Correct ? | 2 Yes | 16 No |
Tell us something about mutex.
How the Kernel handles both the page stealer and the fault handler?
Tell me something about the concept of memory leak?
What are the various ipc mechanisms?
Explain page fault interrupt?
How long does it take to chkdsk 1tb?
Which os is best for coding?
Is bgp layer 3 or 4?
What is monolithic kernel?
One starts counting from 0 to max and the other stars from max to 0. Which one executes fast.
What is time slice?
Can I delete the program files x86?
Windows 
