Algorithms/optPageReplacement.cpp at master · piyush-hack/Algorithms · GitHub

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
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n, m, i, j, k;
    cout << "Enter number of frames\n";
    cin >> n;
    cout << "Enter number of processes\n";
    cin >> m;
    vector<int> p(m);
    cout << "Enter processes\n";
    for (i = 0; i < m; i++)
    {
        cin >> p[i];
    }
    vector<vector<int>> a(n, vector<int>(m, -1));
    map<int, int> mp;
    for (i = 0; i < m; i++)
    {
        vector<int> op;
        vector<pair<int, int>> c;
        for (auto q : mp)
        {
            c.push_back({q.second, q.first});
        }
        for (int q = i + 1; q < m; q++)
        {
            for (j = 0; j < n; j++)
            {
                if (a[j][i] == p[q])
                {
                    op.push_back(p[q]);
                }
            }
        }
        sort(op.begin(), op.end());
        op.erase(unique(op.begin(), op.end()), op.end());
        bool dontCall = true;
        if (op.size() == n)
        {
            dontCall = false;
        }
        sort(c.begin(), c.end());
        bool hasrun = false;
        for (j = 0; j < n; j++)
        {
            if (a[j][i] == p[i])
            {
                mp[p[i]]++;
                hasrun = true;
                break;
            }
            if (a[j][i] == -1)
            {
                for (k = i; k < m; k++)
                    a[j][k] = p[i];
                mp[p[i]]++;
                hasrun = true;
                break;
            }
        }
        if (j == n || hasrun == false)
        {
            for (j = 0; j < n; j++)
            {
                if (dontCall == true)
                {
                    if (a[j][i] == c[c.size() - 1].second)
                    {
                        mp.erase(a[j][i]);
                        for (k = i; k < m; k++)
                            a[j][k] = p[i];
                        mp[p[i]]++;
                        break;
                    }
                }
                else if (dontCall == false)
                {
                    if (a[j][i] == op[op.size() - 1])
                    {
                        mp.erase(a[j][i]);
                        for (k = i; k < m; k++)
                            a[j][k] = p[i];
                        mp[p[i]]++;
                        break;
                    }
                }
            }
        }
        for (auto q : mp)
        {
            if (q.first != p[i])
            {
                mp[q.first]++;
            }
        }
    }
    int hit = 0;
    vector<int> hitv(m);
    for (i = 1; i < m; i++)
    {
        for (j = 0; j < n; j++)
        {
            if (p[i] == a[j][i - 1])
            {
                hit++;
                hitv[i] = 1;
                break;
            }
        }
    }
    cout << "Process ";
    for (i = 0; i < m; i++)
    {
        cout << p[i] << " ";
    }
    cout << '\n';
    for (i = 0; i < n; i++)
    {
        cout << "Frame " << i << " ";
        for (j = 0; j < m; j++)
        {
            if (a[i][j] == -1)
                cout << "E ";
            else
                cout << a[i][j] << " ";
        }
        cout << '\n';
    }
    cout << "HIT     ";
    for (i = 0; i < hitv.size(); i++)
    {
        if (hitv[i] == 0)
            cout << "  ";
        else
            cout << hitv[i] << " ";
    }
    cout << "\n";
    cout << "Hit " << hit << '\n'
         << "Page Fault " << m - hit << '\n';
    return 0;
}