A Novel Longest Distance First Page Replacement Algorithm

Objectives: To improve the performance of computer in program execution by employing Longest Distance First page replacement algorithm in memory management. Method: There are many traditional page replacement algorithms used in virtual memory organization like FIFO, LRU, Optimal page replacement, CAR, ARC etc, each of these algorithms tries to reduce the number of page faults in selection of victim page from the memory frames. This paper presents all the popular page replacement algorithms and a new approach named as “Longest Distance First (LDF)” page replacement algorithm. Findings: From experimental results and analysis, it has been observed that, LDF produced better performance in terms of page fault rate and implementation overhead than many traditional page replacement algorithms like FIFO, LRU. From the results, the average page fault of LDF is better than FIFO and LRU of taken data set. Applications: LDF can be used in virtual memory management to improve performance of computer system by minimize page fault rate.