📞 +91-7667918914 | ✉️ ijarcce@gmail.com
IJARCCE Logo
International Journal of Advanced Research in Computer and Communication Engineering A monthly Peer-reviewed & Refereed journal
ISSN Online 2278-1021ISSN Print 2319-5940Since 2012
IJARCCE adheres to the suggestive parameters outlined by the University Grants Commission (UGC) for peer-reviewed journals, upholding high standards of research quality, ethical publishing, and academic excellence.
← Back to VOLUME 9, ISSUE 10, OCTOBER 2020

Analysis of Random Page Replacement Algorithm in Operating System

Tri Dharma Putra, Rakhmat Purnomo, Wowon Priatna

DOI: 10.17148/IJARCCE.2020.91009

Abstract: Page replacement algorithms choose pages to swap out from memory, namely when a new page needs allocation memory. Several page replacement algorithms proposed by experts. Four well known page replacement algorithms are Least Recently Used (LRU), Optimal Page Replacement (OPR), First In First Out (FIFO), Random page replacement algorithms. Each one has the objective to minimize the page fault. If the minimum page fault achieved, the performance of the process increased. The algorithm discussed is random page replacement algorithm. In this paper three case studies of random page replacement algorithm are discussed thoroughly. Keywords: Random page replacement algorithm, page fault, page replacement algorithm, FIFO, LRU, OPR

How to Cite:

[1] Tri Dharma Putra, Rakhmat Purnomo, Wowon Priatna, “Analysis of Random Page Replacement Algorithm in Operating System,” International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE), DOI: 10.17148/IJARCCE.2020.91009