Analysis of Random Page Replacement Algorithm in Operating System

Dharma Putra, Tri and Purnomo, Rakhmat and Priatna, Wowon (2020) Analysis of Random Page Replacement Algorithm in Operating System. International Journal of Advanced Research in Computer and Communication Engineering, International Journal of Advanced Research in Computer and Communication Engineering.

[img] Text
Submit Article - wowon.priatna@dsn.ubharajaya.ac.id - Email Universitas Bhayangkara Jakarta Raya.pdf

Download (316kB)
[img] Text
IJARCCE _ Reviewers Report - Rakhmat Purnomo .pdf

Download (202kB)
[img] Text
Fwd_ _ Acceptance Notification _ Rakhmat Purnomo - wowon.priatna@dsn.ubharajaya.ac.id - Email Universitas Bhayangkara Jakarta Raya.pdf

Download (283kB)
[img] Text
ST 003 (1).pdf

Download (1MB)

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

Item Type: Other
Subjects: Teknologi dan Ilmu Terapan > Teknik Informatika
Creators:
CreatorsNIM/NIDN
Dharma Putra, Tri0302117101
Purnomo, Rakhmat0322108201
Priatna, Wowon0429118007
Depositing User: Wowon Priatna
Date Deposited: 02 Dec 2020 01:24
Last Modified: 02 Dec 2020 01:24
URI: http://repository.ubharajaya.ac.id/id/eprint/6148

Actions (login required)

View Item View Item