Which is the best page replacement algorithm and
why? How much time is spent usually in each phases and
why?
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 |
What are the basic functions of file management in os?
Define Operating System Types.
What is gang scheduling in operating system (os)?
How the Kernel handles both the page stealer and the fault handler?
Explain about processor and the functions executed by them?
abcD+abcd+aBCd+aBCD then the simplified function is ( Capital letters are copliments of corresponding letters A=compliment of a) [a] a [b] ab [c] abc [d] a(bc)* [e] mone (bc)*=compliment of bc
Are 64bit applications faster?
Why do I have x86 program file?
How are data structures handled by ntfs?
Can you please explain the difference between trap and trapdoor?
What is interrupt table?
How does the cpu and the ram communicate?