Abstract—A virtual memory system needs efficient page replacement algorithms to decide which pages to evict from memory in case of a page fault. Over the years many algorithms have been proposed for page replacement. Each algorithm attempts to minimize the page fault rate while incurring minimum overhead. As newer memory access patterns were explored, research mainly focused on formulating newer approaches to page replacement which could adapt to changing workloads. This paper attempts to summarize major page replacement algorithms proposed till date. We look at the traditional algorithms such as LRU and CLOCK, and also study the recent approaches such as LIRS, CLOCK-Pro, ARC, and CAR.
Index Terms—Page Replacement, LRU, LIRS, CLOCK-Pro, ARC, CAR.
Amit S. Chavan is with the Veermata Jijabai Technological Institute, Matunga, Mumbai – 400019, India. (email: camit90@gmail.com)
Kartik R. Nayak is with the Veermata Jijabai Technological Institute, Matunga, Mumbai – 400019, India. (email: kartik.r.nayak@gmail.com)
Keval D. Vora is with the Veermata Jijabai Technological Institute, Matunga, Mumbai – 400019, India. (email: kevalvora@gmail.com)
Manish D. Purohit is with the Veermata Jijabai Technological Institute, Matunga, Mumbai – 400019, India. (email: purohitmanish89@gmail.com)
Pramila M. Chawan is with the Veermata Jijabai Technological Institute, Matunga, Mumbai – 400019, India. (email: pmchawan@gmail.com)
Cite: Amit S. Chavan, Kartik R. Nayak, Keval D. Vora, Manish D. Purohit and Pramila M. Chawan, "A Comparison of Page Replacement Algorithms," International Journal of Engineering and Technology vol. 3, no. 2, pp. 171-174, 2011.
Copyright © 2008-2024. International Journal of Engineering and Technology. All rights reserved.
E-mail: ijet_Editor@126.com