Analysis of Various Page Replacement Algorithms in Operating System
Journal: International Journal of Science and Research (IJSR) (Vol.5, No. 12)Publication Date: 2016-12-05
Authors : Bhagyashree A. Tingare; Vaishali L. Kolhe;
Page : 578-584
Keywords : Optimal replacement; Random replacement; NRU; Aging; ARC; CART; Tokenordered LRU;
Abstract
Page replacement algorithms were a warm topic of research and debate in the 1960s and 1970s. In a computer operating system that uses paging for virtual memory management, page replacement algorithms decide which memory pages to page out (swap out, write to disk) when a page of memory needs to be allocated. Paging happens when a page fault occurs and a free page cannot be used to satisfy the allocation, either because there are none, or because the number of free pages i lower than some threshold. The page replacing problem is a typical online problem from the competitive analysis perspective in the sense that the optimal deterministic algorithm is known. This paper is analysis on various page replacement algorithms like Optimal replacement, Random replacement, Not Recently Used (NRU), First-In, First-Out (FIFO), Least Recently Used (LRU), Second Change and CLOCK, Not Frequently Used (NFU), and some approaches like Aging, Two Queue (2Q), SEQ, Adaptive Replacement Cache (ARC), CLOCK with Adaptive Replacement (CAR), CAR with Temporal filtering (CART), Token-ordered LRU, CLOCK-Pro.
Other Latest Articles
- Review of Political Violence: The Nigerian Experience of Youth in Political Violence
- Review of Marketing Strategies of KVIC
- Analysis Development of Society Participation in Forest Area of Papantiri Sub-Province of Muna
- A Case Report on Limited Wegner's Granulomatosis
- Effect of Biotic and Abiotic Stress on the Development and Production of Calligonum Polygonoides Subsp.Comosum Grown in Tunisian Arid Conditions
Last modified: 2021-07-01 14:48:53