Page Replacement Algorithms | Help |
Algorithm Descriptions
1. Random: This algorithm replaces the page in memory by random selection.
2. First in First Out (FIFO): Algorithm treats the page frames allocated to a process as a circular buffer, and pages are removed in round-robin style.
3. Least Recently Used (LRU): Replaces the page in memory that has not been referenced for the longest time.
4. Most Frequently Used (MFU): Replaces the page in memory that has the smallest counter, in other words the page is replaced that has been accessed the least number of times.
Helpful Hints