Total views : 155

A Novel Longest Distance First Page Replacement Algorithm


  • Department of Information Technology, Raj Kumar Goel Institute of Technology and Management, Ghaziabad - 201001, Uttar Pradesh, India
  • Department of Computer Engineering, YMCA University of Science and Technology, Faridabad - 121006, Haryana, India


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.


FIFO, LRU, LDF, Memory Management, Optimal Replacement, Virtual Memory

Full Text:

 |  (PDF views: 78)


  • Belady LA. A study of replacement algorithms for virtual storage computers. IBM Systems Journal. 1966; 5(2):78– 101. Crossref
  • Mattson RL, Gecsei J, Slutz DR, Traiger IL. Evaluation techniques for storage hierarchies. IBM System Journal. 1970; 9(2):78–117. Crossref
  • Aho AV, Denning PJ, Ullman JD. Principles of optimal page replacement. Journal of the ACM. 1971; 18(1):80–93.Crossref
  • Meigiddo N, Modha DS. ARC a self-tuning low overhead replacement cache. IEEE Transactions on Computers.2003; 115–30.
  • Bansal S, Modha DS. CAR clock with adaptive replacement. FAST 04 Proceedings of the 3rd USENIX Conference on File and Storage Technologies; 2004. p. 187–200.
  • Tanenbaum AS. Modern operating systems. 4th ed. Pearson; 2015.
  • Gagne G. Silberschatz A, Galvin PB. Operating systems concepts. 7th ed. 2005.
  • Jiang S, Zhang X. LIRS an efficient policy to improve buffer cache performance. IEEE Transactions on Computers.2002 Jun; 30(1):31–42.
  • Jiang S, Zhang X, Chen F. CLOCK-pro an effective improvement of the CLOCK replacement. ATEC 05 Proceedings of the Annual conference on USENIX Annual Technical Conference; 2005. p. 35–5.
  • Oneil EJ, Oneil EP, Weikum G. An optimality proof of the LRU-K Page replacement algorithm. Journal of the ACM.1999 Jan; 46(1):92–112. Crossref
  • Denning PJ, Kahn KC. A study of program locality and lifetime functions. ACM SIGOPS Operating Systems Review.1975 Nov; 9(5):207–16. Crossref
  • Denning, PJ. The working set model of program behavior.Communications of the ACM. 1968 May; 11(5):323–33. Crossref


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.