Study and Comparison of Replacement Algorithms
DOI:
https://doi.org/10.31695/IJERAT.2022.8.8.1Keywords:
Page Replacement, Page fault, Replacement Algorithm, ClockAbstract
When a page fault occurs, the operating system has to choose a page to remove from memory to make room for the page that has to be brought in. The page replacement is done by swapping the required pages from backup storage to main memory and vice-versa. When a new page needs memory for allocation, page replacement algorithms decide which pages to swap out of the memory. In this paper, a comparison and analysis of five replacement algorithms: First in First out (FIFO), Least Recently Used (LRU), Clock, Most Recently Used algorithm (MRU), and Optimal Page Replacement (OPT) are made.
References
Salam Ayad, “A proposed multilevel replacement algorithm for cache memory”, master thesis submitted to the department of computer science, Education collage, al- Mustansiriyah university, 2016.
Mahesh Kumar M , Renuka Rajendra ,” AN INPUT ENHANCEMENT TECHNIQUE TO MAXIMIZE THE PERFORMANCE OF PAGE REPLACEMENT ALGORITHMS”, International Journal of Research in Engineering and Technology, Volume: 04 Issue: 06 | June-2015.
Muhammad Waqar, Anas Bilal, Ambreen Malik and Imran Anwar , “COMPARATIVE ANALYSIS OF REPLACEMENT ALGORITHMS TECHNIQUES REGARDING TO TECHNICAL ASPECTS”, European Journal of Engineering and Technology, Vol. 4 No. 5, 2016.
M.Saktheeswari*1 K.Sridharan*,” A STUDY ON PAGE REPLACEMENT ALGORITHMS”, International Journal of Technology and Engineering System (IJTES), Vol 3. No.2,2012
Prof. D. Pradhan, “Cache Design”, design approach, Technical Report, Department of Computer Science, University of Bristol, 2000.
D. H. Albonesi, “Selective Cache Ways”, Technical Report, On-Demand Cache Resource Allocation, Dept. of Electrical and Computer Engineering, University of Rochester, 2000.
Sourabh Shastri, 2Anand Sharma, 3Vibhakar Mansoura,” Study of Page Replacement Algorithms and their analysis with C+ ”, The International Journal Of Engineering And Science, IJES, Volume 5, Issue1, PP -53-57, 2016
Genta Rexha1, Erand Elmazi2,Igli Tafa2,” A Comparison of Three Page Replacement Algorithms: FIFO, LRU and Optimal”, Academic Journal of Interdisciplinary Studies
MCSER Publishing, Rome-Italy, Vol 4 No 2 S2, August 2015.
Amit S. Chavan, Kartik R. Nayak, Keval D. Vora, Manish D. Purohit and Pramila M. Chawan,” A Comparison of Page Replacement Algorithms”, IACSIT International Journal of Engineering and Technology, Vol.3, No.2, April 2011.
Yannis Smaragdakis,” General Adaptive Replacement Policies”, ISMM’04, October 24–25, 2004, Vancouver, British Columbia, Canada
Downloads
Published
Issue
Section
License
Copyright (c) 2022 Safana Hyder Abbas, Wedad Abdul Khuder Naser, Lamyaa Mohammed Kadhim
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
