Beladys Anomaly
Everything on SkillVeris tagged Beladys Anomaly — collected across the glossary, study notes, blog, and cheat sheets.
4 resources across 1 library
Interview Questions(4)
What is the LRU Page Replacement Algorithm?
Least Recently Used (LRU) page replacement evicts the page that has gone the longest without being referenced, on the assumption that pages accessed far in the…
What is the FIFO Page Replacement Algorithm?
First-In-First-Out (FIFO) page replacement evicts the page that has been resident in memory the longest, regardless of how recently or frequently it has actual…
What is the Optimal (OPT/Belady’s) Page Replacement Algorithm?
The Optimal page replacement algorithm — also called OPT or Belady’s algorithm — evicts the page that will not be used for the longest time in the future, whic…
What is Belady’s Anomaly?
Belady’s Anomaly is the counter-intuitive situation where increasing the number of page frames available to a process actually increases the number of page fau…