Indian Journal of Science and Technology
DOI: 10.17485/ijst/2017/v10i30/115500
Year: 2017, Volume: 10, Issue: 30, Pages: 1-6
Original Article
Gyanendra Kumar1 * and Parul Tomar2
1Department of Information Technology, Raj Kumar Goel Institute of Technology and Management, Ghaziabad - 201001, Uttar Pradesh, India; [email protected] 2Department of Computer Engineering, YMCA University of Science and Technology, Faridabad - 121006, Haryana, India; [email protected]
*Author for the correspondence:
Gyanendra Kumar
Department of Information Technology, Raj Kumar Goel Institute of Technology and Management, Ghaziabad - 201001, Uttar Pradesh, India; [email protected]
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.
Keywords: FIFO, LRU, LDF, Memory Management, Optimal Replacement, Virtual Memory
Subscribe now for latest articles and news.
