Which is the best page replacement algorithm and Why ?
- 5 Answers
- 36789 Views
- Honeywell, Intel, TCS, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / pravin tripathi
optimal page replacement algorithm seems to be the best page
replacement algorithm as"the no. of page faults are minimum
as compared to any page replacement algorithm as well as it
is free from belady's anomaly",but the problem is that,it is
very difficult to implement as it need the future knowledge
of reference string.
while least-recently-used(LRU)algorithm is also free
from belady's anamoly and the no. of page faults are fewer
than any other page repl. algorithm(besides OPT algorithm)
it is easy to implement.and is the best page replacement
algorithm.
| Is This Answer Correct ? | 98 Yes | 9 No |
Answer / scandal
Optimal page replacement algorithm.
Bcoz it overcomes the belady's anomaly;
number of page fault is low.
| Is This Answer Correct ? | 74 Yes | 7 No |
Answer / nandu
best page replacement algorithm optimal.no of page faults
minimum compared to other
| Is This Answer Correct ? | 6 Yes | 1 No |
Answer / dorathy
Optimal algorithm is the best... It has fewer page faults and avoids beladys anamolies..
| Is This Answer Correct ? | 2 Yes | 1 No |
Answer / tauqeer sahi
Optimal is best but impossible to implement..
There are other good algorithms too but outcome of any algorithm totally depends upon type of input string of pages.
Anyway I thing aging is better and is currently being used by linux
| Is This Answer Correct ? | 0 Yes | 2 No |
What killed mandla maseko?
Explain IPC?
Mention the steps involved in the execution of a program.
What is operating system in computer?
Explain an idle thread?
What is operating system in english?
Who does the memory management in operating system?
Differentiate between ROM and RAM?
Explain the concept of Reentrancy?
1 Answers ADP, Microsoft, Seasia Infotech,
What is 64 bit platform?
What grep means?
Why is mapping required? Computer 'Paging' & 'Segmentation'.
Windows 
