Abstract: In the last decades 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.
Nabeel Zanoon, Evon Abu-Taieh and Hatem Salem Abu-Hamatta, 2018. A Novel Approach to Improve LRU Page Replacement Algorithm. Journal of Engineering and Applied Sciences, 13: 478-483.