Bélády's anomaly
Computer storage phenomenon / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Bélády's anomaly?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
In computer storage, Bélády's anomaly is the phenomenon in which increasing the number of page frames results in an increase in the number of page faults for certain memory access patterns. This phenomenon is commonly experienced when using the first-in first-out (FIFO) page replacement algorithm. In FIFO, the page fault may or may not increase as the page frames increase, but in optimal and stack-based algorithms like LRU, as the page frames increase, the page fault decreases. László Bélády demonstrated this in 1969.[1]
This article needs additional citations for verification. (November 2021) |
Quick Facts → Time {\displaystyle {\ce {->[{} \atop {\text{Time}}]}}}, Page requests ...
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
An example of Bélády's anomaly. Using three page frames, nine page faults occur. Increasing to four page frames causes ten page faults to occur. Page faults are in red. This can be thought of as a result of a "Penny Wise, Pound Foolish" behavior. |
Close