ScholarLens Back to search
2018•International Journal for Advance Research and DevelopmentRequires access

Analysis of page replacement algorithms using C

Aye Aye Cho

Open publisher page 0 citations

Abstract

Page replacement algorithms are important of virtual memory management and it helps the operating system to decide which memory page can be moved out making space for the currently needed page. Whenever a process refers to a page that is not present in memory, a page fault occurs. Each algorithm has the objective to minimize the number of page faults. With minimum page faults, the performance of the process is increased. The purpose of this paper is to analyze the three algorithms via. First in First out(FIFO), Least Recently Used(LRU) and Optimal Page Replacement(OPT) is implemented using C++ programming. We will present implementation of three algorithms and compare their performance on generated virtual traces.

About this research paper

What this paper is about

Page replacement algorithms are important of virtual memory management and it helps the operating system to decide which memory page can be moved out making space for the currently needed page. Whenever a process refers to a page that is not present in memory, a page fault occurs. Each algorithm has the objective to minimize the number of page faults. With minimum page faults, the performance of the process is increased. The purpose of this paper is to analyze the three algorithms via. First in First out(FIFO), Least Recently Used(LRU) and Optimal Page Replacement(OPT) is implemented using C++ programming. We will present implementation of three algorithms and compare their performance on generated virtual traces.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Page replacement algorithms are important of virtual memory management and it helps the operating system to decide which memory page can be moved out making space for the currently needed page. Whenever a process refers to a page that is not present in memory, a page fault occurs. Each algorithm has the objective to minimize the number of page faults. With minimum page faults, the performance of the process is increased. The purpose of this paper is to analyze the three algorithms via. First in First out(FIFO), Least Recently Used(LRU) and Optimal Page Replacement(OPT) is implemented using C++ programming. We will present implementation of three algorithms and compare their performance on generated virtual traces.

Key concepts: Demand paging, Page fault, Virtual memory, Computer science, FIFO (computing and electronics), Page, Algorithm, Process (computing)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Analysis of page replacement algorithms using C — Research Paper | ScholarLens