Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Engineering Research and Advanced Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.