A Novel Approach to Design Extended LFU Page Replacement Algorithm

Abstract

            Research on page replacement algorithms is a very core research field in Advance Operating Systems. Today any advancement in sorting algorithms would lead to higher hit rate and lower page fault rate, that would further decrease the time required to serve the pages. This paper discusses a newly proposed page replacement algorithm – “Extended LFU Page Replacement Algorithm.” It is basically an advancement to LFU page replacement algorithm. The purpose of this paper is to reduce the page fault rate and increase the hit rate in a page replacement process where there is repeated request of multiple pages over a request string of considerable length. This paper also compares the newly proposed algorithm with LFU page replacement algorithm in terms of hit rate and page fault rate through graphical analysis.