Study and Comparison of Replacement Algorithms
Safana Hyder Abbas, Wedad Abdul Khuder Naser, Lamyaa Mohammed Kadhim · International Journal of Engineering Research and Advanced Technology · 2022
When a page fault occurs, the operating system has to choose a page to remove from memory to make room for the page that has to be brought in. The page replacement is done by swapping the required pages from backup storage to main memory and vice-versa. When a new page needs memory for allocation, page replacement algorithms decide which pages to swap out of the memory. In this paper, a comparison and analysis of five replacement algorithms: First in First out (FIFO), Least Recently Used (LRU), Clock, Most Recently Used algorithm (MRU), and Optimal Page Replacement (OPT) are made.