Abstract
Page replacement algorithms choose pages to swap out from memory, namely when a new page needs allocation memory. Several page replacement algorithms proposed by experts. Four well known page replacement algorithms are Least Recently Used (LRU), Optimal Page Replacement (OPR), First In First Out (FIFO), Random page replacement algorithms. Each one has the objective to minimize the page fault. If the minimum page fault achieved, the performance of the process increased. The algorithm discussed is random page replacement algorithm. In this paper three case studies of random page replacement algorithm are discussed thoroughly
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
