A Comprehensive Survey of Page Replacement Algorithms (original) (raw)

Efficient page replacement algorithms are needed in virtual memory system to make a decision which pages to evict from memory in case of a page fault. Many algorithms have been proposed over the years. Each algorithm tries to incur minimum overhead while attempting to minimize the page fault rate. Formulating newer approaches of page replacement which could adapt to changing workloads have been the main focus of research as newer memory access patterns were explored. 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, Working Set, WSClock, Dynamic Sort.