Paper Title
An Ingenious Page Replacement Technique
Abstract
Virtual memory, a technique that allows the execution of processes that require memory greater than the actual
physical memory available, is implemented using demand paging, which in turn is governed by a page replacement
algorithm. In this paper, we propose a page replacement algorithm that performs better than the anterior ones. This algorithm
is implemented using the total number of references of elements in the reference string, and a buffer frame. We have shown
the results for three and four frames that indicate its better performance compared to FIFO, LRU and optimal page
replacement algorithms. Our algorithm aims at enhancing the performance of a system by decreasing the page fault rate and
increasing the hit percentage.
Keywords— Virtual memory, demand paging, page replacement, FIFO, Optimal, LRU, Kashu algorithm, page fault, hit
percentage.