0
$\begingroup$

I am wondering if there is an instance where FIFO results in less page faults than LRU. For example:

2,6,5,7... 

In this string, if I have to complete it by giving 3 additional terms, can I prove FIFO shows less page faults

I have proved how LRU can show less Page faults. But I cannot think of the initial problem statement solution. Any hints would really be great!

$\endgroup$
  • $\begingroup$ Why do you put the constraint "by giving 3 additional terms"? Is this the original question? $\endgroup$ – xskxzr Feb 21 at 12:12

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.