@article{MAKHILLJEAS201813215450,
    title = {A Novel Approach to Improve LRU Page Replacement Algorithm},
    journal = {Journal of Engineering and Applied Sciences},
    volume = {13},
    number = {2},
    pages = {478-483},
    year = {2018},
    issn = {1816-949x},
    doi = {jeasci.2018.478.483},
    url = {https://makhillpublications.co/view-article.php?issn=1816-949x&doi=jeasci.2018.478.483},
    author = {Nabeel,Evon and},
    keywords = {Replacement algorithm,LRU-time,optimal,page fault,locality,access pattern},
    abstract = {In the last decade’s several page replacement algorithms had been implemented such as Least
Recently Used (LRU), First Income First Out (FIFO) and optimal. Each of them has its own advantages and
disadvantages. The process of page selection is time-consuming and depends on many factors: operating
system and architecture as well as algorithms that will be used. Both LRU and optimal are implemented based
on page fault rate. This study proposed LRU-Time dubbed as LRU-T which is a new algorithm to limits the
number of pages the algorithm search through in order to reduce the page fault rate and tracking page
frequencies during specified amount of time. The proposed algorithm was tested against the mentioned
algorithms using a simulation program. The novelty behind the algorithm is improving the performance of LRU
algorithm and increases its efficiency.}
    }