Describe the cause of Belady\'s anomaly demonstrated by the FIFOinput data. I wr

Question

Describe the cause of Belady's anomaly demonstrated by the FIFOinput data.

I wrote:
In computer storage, Bélády's anomaly proves that itis possible to have more page faults when increasing the number ofpage frames while using FIFO method of frame management.László Bélády demonstrated this in1969.

In common computer memory management, information is loaded inspecific sized chunks. Each chunk is referred to as a page. Thecentral processor can only load a limited number of pages at atime. It requires a frame for each page it can load. A page faultoccurs when a page is not found, and might need to be loaded fromdisk into memory.

When a page fault occurs and all frames are in use, one must becleared to make room for the new page. A simple algorithm is FIFO.Whichever page has been in the frames the longest is the one thatis cleared. Until Bélády's anomaly was demonstrated,the FIFO algorithm was assumed to be acceptable.

Look good?
Thanks

Explanation / Answer

Dear,        Usually, onincreasing the number of frames allocated to a processes virtualmemory, the process execution is faster, because fewer page faultsoccur. Sometimes, the reverse happens, i.e., the execution timeincreases even when more frames are allocated to the process. Thisis known as the Belady's Anomaly. This is true for certain pagereference patterns.        The Belady's anomalyoccurs in case of the FIFO page replacement policy in the OS.Whenthis FIFO is used and the number of page frames are increased innumber then the frames that are required by the program varies in alarge range(due to large no of pages) as a result of this thenumber of page faults increases with the number of frames. This isalso called the FIFO anomaly. " I hope this will help you"

Related Questions

Navigate

• Browse (All)
• Browse D
• Subjects

---

---

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