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
- 14361 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
Measurements of a certain system have shown that the
average process runs for a time T before blocking
on I/O. A process switch requires a time S, which is
effectively wasted (overhead). The CPU’s efficiency is
the fraction of its time its spends executing user
programs, i.e., executing user processes. For round robin
scheduling with quantum Q, give a formula for the CPU
efficiency for each of the following:
(a) Q = ∞
(b) Q > S + T
(c) S what's the latest ram lunch? What are the four necessary and sufficient conditions behind the deadlock? State the advantages of segmented paging over pure segmentation? What is lxde desktop? Explain IPC? Explain about compiler and the functions executed by them? What does echo $$ do? What does tty mean? How do I find system information? What is the main cause of blue screen of death? Is intel core i5 64 bit or 32 bit? What are the 4 types of communication? Explain a system in safe state? What is ThreadPool?
