Loading…
A buffer based page replacement algorithm to reduce page fault
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 t...
Saved in:
Main Authors: | , , , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Citations: | Items that this one cites |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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. |
---|---|
ISSN: | 2214-7853 2214-7853 |
DOI: | 10.1016/j.matpr.2020.08.182 |