Abstract
Virtual memory management uses paging in any operating system, the page replacement algorithm uses to decide which memory pages are to swap out, which depends on the number of page faults. Each algorithm has the aim to have less number of page faults. There are different types of Page Replacement Algorithm, in which we discuss, are Second Chance Page Replacement Algorithm and our new approach is Second Chance with Optimal. Second Chance is a simple modification to FIFO and our new approach is depending on a simple modification to Optimal. According to our research Optimal with Second Chance Replacement Algorithm is better than Second Chance Replacement Algorithm because it has the least number of page faults as compared to the FIFO in Second Chance Replacement Algorithm.
Sign-in/Register to access full text options 
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.
