Hi Gurus,
For an algorithm to experience Belady's anomaly, a page that will be referenced in future needs to necessarily evicted.
I understand that MRU as its name stands, removes pages that are needed the most, totally opposite to the idea of locality of reference. Although there are certain instances where it does better than others ( for example in case of a loop).
Is it true that MRU can suffer Belady's Anomaly in any unfavorable cases?
I have searched for an answer to this query for a day long, but found no explicit answer to this. I believe someone from the Science Forum, can surely help me understand this.
Thanks,
Aniruddha
India
