Join or Log in
When a page fault occurs and all frames are in use, one must be cleared to make room for the new page. A simple algorithm is FIFO: whichever page has been in the frames the longest is the one that is cleared.
Bélády's anomaly - Wikipedia 
Added 14 days ago by Josh Shi
Show info
Bélády's anomaly - Wikipedia 
Info
When a page fault occurs and all frames are in use, one must be cleared to make room for the new page. A simple algorithm is FIFO: whichever page has been in the frames the longest is the one that is cleared.
1 Connection