Abstract
In the memory management system, the page replacement algorithm is an inevitable concept. When the Kernel creates a process, the pages are required to be in the main memory. If the pages are not found in the main memory [4], then it is called page fault. When a page fault occurs, the process needs to bring back the pages in disk. If there is a space in main memory it will be put in this area, otherwise a page replacement with the algorithm is implemented. A number of page replacing algorithms have been implemented. The main aim of this paper is to reduce the page fault, and this paper proposes a new idea for implementing a page replacement, so that the page fault reduces by a minimum of 5%.method: two more inputs read from the reference string, and are to be stored in a buffer for reference before replacing the pages in the frames. This novel algorithm increases the success rate.
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.
