The document discusses the behavior of the optimal page replacement algorithm, highlighting its similarity to the Most Recently Used (MRU) algorithm and its contradiction to the principle of locality. It explains that in certain scenarios, such as when the reference string is a mirror image, the optimal algorithm behaves like Least Recently Used (LRU) and First-In-First-Out (FIFO) algorithms to minimize page faults. The notes are authored by Joyoshish Saha and are available for download.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
6 views192 pages
Os Bookmarked Note
The document discusses the behavior of the optimal page replacement algorithm, highlighting its similarity to the Most Recently Used (MRU) algorithm and its contradiction to the principle of locality. It explains that in certain scenarios, such as when the reference string is a mirror image, the optimal algorithm behaves like Least Recently Used (LRU) and First-In-First-Out (FIFO) algorithms to minimize page faults. The notes are authored by Joyoshish Saha and are available for download.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 192
GATE CSE NOTES
by Joyoshish Saha
Downloaded from https://gatecsebyjs.github.io/
With best wishes from Joyoshish Saha Here optimal replacement algo acts as Most Recently Used (MRU) algo. Behaviour of optimal algo contradicts with the principle of locality. Principle of temporal locality does not hold true in certain scenarios. 1 2 3 1 2 3 -> 3 will be replaced (recently used)
2. For a reference string where first half of the string is a
mirror image of the other half (1 2 3 3 2 1), optimal algo replaces the LRU page or firstly arrived page to minimise page faults. Thus, optimal algo acts as LRU and FIFO algo.