-
Notifications
You must be signed in to change notification settings - Fork 1
/
EnhancedSecondChance_PR.cpp
151 lines (135 loc) · 4.69 KB
/
EnhancedSecondChance_PR.cpp
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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
// C++ implementation of 'Enhanced - Second chance Page Replacement' Algorithm
#include <bits/stdc++.h>
using namespace std;
struct page
{
int page_no;
int modified_bit;
int use_bit = 0;
};
int main()
{
int pages, frames, pf = 0;
cout << "\nEnter the total number of pages : ";
cin >> pages;
cout << "\nEnter number of frames : ";
cin >> frames;
struct page reference_string[pages];
// Create a array to hold page numbers
struct page arr[frames];
for (int i = 0; i < frames; i++)
{
arr[i].page_no = -1;
}
cout << "Enter Page no. and their Modified bit :\n\n";
for (int i = 0; i < pages; i++)
{
cout << "Enter Page : ";
cin >> reference_string[i].page_no;
cout << "Modified Bit : ";
cin >> reference_string[i].modified_bit;
cout << endl;
}
// for first page..
pf = 1;
reference_string[0].use_bit = 1;
arr[0].page_no = reference_string[0].page_no;
arr[0].use_bit = 1;
arr[0].modified_bit = reference_string[0].modified_bit;
int k = 1;
for (int i = 1; i < pages; i++)
{
int j;
for (j = 0; j < frames; j++)
{
if (arr[j].page_no == reference_string[i].page_no)
{
// page hit..
arr[j].modified_bit = reference_string[i].modified_bit;
reference_string[i].use_bit = 1;
arr[j].use_bit = 1;
break;
}
}
if (j == frames && k <= frames - 1)
{
// if space left in frames..
arr[k].page_no = reference_string[i].page_no;
arr[k].modified_bit = reference_string[i].modified_bit;
arr[k].use_bit = 1;
reference_string[i].use_bit = 1;
k++;
pf++;
}
else if (j == frames && k > frames - 1)
{
// page fault occur..
// so replacement is necessary here.
while (reference_string[i].use_bit != 1)
{
int flag1 = 0, flag2 = 0, idx_1 = -1, idx_2 = -1;
// Checking for class (0,0)
for (int count = 0; count < frames; count++)
{
if (arr[count].modified_bit == 0 && arr[count].use_bit == 0)
{
flag1 = 1;
idx_1 = count;
break;
}
}
// Checking for class (0,1)
for (int count = 0; count < frames; count++)
{
if (arr[count].use_bit == 0 && arr[count].modified_bit == 1)
{
flag2 = 1;
idx_2 = count;
break;
}
}
if (flag1 == 1 && flag2 == 0)
{
arr[idx_1].page_no = reference_string[i].page_no;
arr[idx_1].modified_bit = reference_string[i].modified_bit;
arr[idx_1].use_bit = 1;
reference_string[i].use_bit = 1;
}
else if (flag1 == 0 && flag2 == 1)
{
arr[idx_2].page_no = reference_string[i].page_no;
arr[idx_2].modified_bit = reference_string[i].modified_bit;
arr[idx_2].use_bit = 1;
reference_string[i].use_bit = 1;
}
else if (flag1 == 1 && flag2 == 1)
{
if (idx_1 < idx_2)
{
arr[idx_1].page_no = reference_string[i].page_no;
arr[idx_1].modified_bit = reference_string[i].modified_bit;
arr[idx_1].use_bit = 1;
reference_string[i].use_bit = 1;
}
else
{
arr[idx_2].page_no = reference_string[i].page_no;
arr[idx_2].modified_bit = reference_string[i].modified_bit;
arr[idx_2].use_bit = 1;
reference_string[i].use_bit = 1;
}
}
else if (flag1 == 0 && flag2 == 0)
{
for (int count = 0; count < frames; count++)
{
arr[count].use_bit = 0;
}
}
}
pf++;
}
}
cout<<"Total Page faults : "<<pf<<endl;
return 0;
}