You have devised a new page-replacement algorithm that you think may be optimal.

Question

You have devised a new page-replacement algorithm that you think may be optimal. In some test cases, Belady’s anomaly occurs. Is the new algorithm optimal? Explain your answer.

Segmentation is similar to paging but uses variable-sized “pages”.

Define two segment-replacement algorithms based on FIFO and LRU page-replacement schemes for segmentation. Remember that since segments are not the same size, the segment that is chosen to be replaced may not be big enough to leave enough consecutive locations for the needed segment. Consider strategies for systems where segments cannot be relocated, and those for systems where they can.

Explanation / Answer

Solution:

Note: The first question is done as per Chegg guidelines, please repost others.

In Blady anomaly what happens is as the number of page frames increases in the page table the number of page faults also increases.

and this should be avoided.

But the new algorithm still suffers from Blady anomaly, this means that this algorithm is still not optimal.

If a page replacement algorithm suffers from Blady's anomaly then it cannot be considered as optimal.

I hope this helps if you find any problem. Please comment below. Don't forget to give a thumbs up if you liked it. :)

Related Questions

Navigate

• Browse (All)
• Browse Y
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.