-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.html
121 lines (109 loc) · 6.43 KB
/
index.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
<!DOCTYPE html>
<html>
<head>
<title></title>
<link rel="stylesheet" href="css/homepage.css">
<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/font-awesome/5.15.3/css/all.min.css"/>
<link href="https://fonts.googleapis.com/css2?family=Baloo+Bhai+2:wght@700&family=PT+Sans&display=swap" rel="stylesheet">
</head>
<body>
<header>
<nav>
<div class="logo">
<img src="img/website_logo1.png" alt="">
</div>
<input type="checkbox" id="check">
<label for="check" class="checkbtn">
<i class="fas fa-bars"></i>
</label>
<ul>
<li><a class="active" href="index.html">HOME</a></li>
<li><a href="#" class="main-dropdown" id="drop-down" onclick="toggle()">ALGORITHMS </a> </li>
<ul class="dropdown" aria-labelledby="navbarDropdown" id="dropdowntoggle">
<li><a class="dropdown-item" href="fifo.html">First In First Out</a></li>
<li><a class="dropdown-item" href="lru.html">Least Recently Used</a></li>
<li><a class="dropdown-item" href="mru.html">Most Recently Used</a></li>
<li><a class="dropdown-item" href="second_chance.html">Second Chance</a></li>
<li><a class="dropdown-item" href="optimal.html">Optimal</a></li>
</nav>
<div class="afternav">
<div>
<h1>PAGE REPLACEMENT ALGORITHMS</h1>
</div>
<div class="content">
<!-- <h1>Page Replacement</h1> -->
<p>One of the techniques which are used for memory management is paging. In paging, processes are divided into pages and main memory is divided into frames. Pages of a process are loaded into frames of main memory when required.
Page Replacement Algorithm is used when a page fault occurs. Page Fault means the page referenced by the CPU is not present in the main memory.
When the CPU generates the reference of a page, if there is any vacant frame available in the main memory then the page is loaded in that vacant frame. In another case, if there is no vacant frame available in the main memory, it is required to replace one of the pages in the main memory with the page referenced by the CPU.
Page Replacement Algorithm is used to decide which page will be replaced to allocate memory to the current referenced page.
Different Page Replacement Algorithms suggest different ways to decide which page is to be replaced. The main objective of these algorithms is to reduce the number of page faults.</p>
</div>
<!-- <div class="nextpage">
<img src="img/background.jpg" alt="">
</div> -->
</div>
</header>
<section class="algorithms">
<h1>Types Of Algorithms</h1>
<div class="rows">
<div class="cols">
<div class="algos" id="row1col1">
<div class="cont" >
<h3>OPTIMAL</h3>
<p>This algorithm replaces the page that will not be used for the longest period of time.</p>
<div class="btns">
<a href="optimal.html" class="moreinfo">More Info</a>
<a href="optimal_simulator.html" class="Demo">Demo</a>
</div>
</div>
</div>
<div class="algos" id="row1col2" >
<div class="cont">
<h3>LRU</h3>
<p>This algorithm replaces the page that has not been used for the longest period of time.</p>
<div class="btns">
<a href="lru.html" class="moreinfo">More Info</a>
<a href="lru_simulator.html" class="Demo">Demo</a>
</div>
</div>
</div>
</div>
<div class="cols" >
<div class="algos" id="col2">
<div class="cont">
<h3>FIFO</h3>
<p>This algorithm replaces the page that was loaded into the memory earlier than any other page reference of the process.</p>
<div class="btns">
<a href="fifo.html" class="moreinfo">More Info</a>
<a href="fifo_simulator.html" class="Demo">Demo</a>
</div>
</div>
</div>
</div>
<div class="cols">
<div class="algos" id="row2col1">
<div class="cont">
<h3>SC</h3>
<p>This algorithm looks at the front of the queue as FIFO does, but instead of immediately paging out that page, checks to see if the referenced bit is set.</p>
<div class="btns">
<a href="second_chance.html" class="moreinfo">More Info</a>
<a href="sc_simulator.html" class="Demo">Demo</a>
</div>
</div>
</div>
<div class="algos" id="row2col2">
<div class="cont">
<h3>MRU</h3>
<p>This algorithm replaces the page which was just recently used in the frame of the main memory.</p>
<div class="btns">
<a href="mru.html" class="moreinfo">More Info</a>
<a href="mru_simulator.html" class="Demo">Demo</a>
</div>
</div>
</div>
</div>
</div>
</section>
</body>
<script src="js/navbar.js"></script>
</html>