-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathprocecesexccuter.java
217 lines (174 loc) · 6.47 KB
/
procecesexccuter.java
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
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
package sample;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;
public class procecesexccuter {
static ArrayList<String> mem_view = new ArrayList<>();
private procececs_random_data p;
int size_in_frames = Controller.sizeofmem;
static LinkedList<memory> mem = new LinkedList<>();
int quantom_time = Controller.timequant;
//LinkedList<memory>memory = new LinkedList<>() ;
public procecesexccuter(procececs_random_data p) {
this.p = p;
}
//this class represent mmu
boolean second_chance() {
int t = 0;
for (int i = p.pointer; i < p.traces.size(); i++) {
p.pointer = i;
if (size_in_frames > p.min_frames_per_proc) {
if (!check_proc_in_mem()) {
mem.addLast(new memory(p));
size_in_frames -= p.min_frames_per_proc;
}
} else {
mem.getFirst().getP().cycles += 5;
mem.removeFirst();
mem.addLast(new memory(p));
}
if (find_if_in_memory(p.traces.get(i))) {
mem_view.add("hit in memory , page id : " + p.traces.get(i) + ", processes id : " + p.getPid()+", at time : " + simulation.time);
p.hits++ ;
} else {
p.cycles += 305;
p.number_of_page_faults++;
p.remainngtime--;
p.burst_time++;
p.pointer++;
if (p.remainngtime == 0) {
return true;
}
mem_view.add("page fault , page id : " + p.traces.get(i) + ",processes id : " + p.getPid() + ", context switch and page " +
"replacement, at time : " + simulation.time);
if (p.framesinmem.size() < p.min_frames_per_proc) {
p.framesinmem.addLast(new frame(p.traces.get(i), 0));
} else {
frame temp = null;
int f = 0;
for (frame j : p.framesinmem) {
if (j.bit_referance == 1) {
j.bit_referance = 0;
} else {
temp = j;
f = 1 ;
break;
}
}
if (f == 1) {
p.framesinmem.remove(temp);
p.framesinmem.addLast(new frame(p.traces.get(i), 0));
}
}
if (p.remainngtime == 0) {
return true;
}
return false ;
}
t += 1;
p.remainngtime--;
p.burst_time++;
if (p.remainngtime == 0) {
return true;
}
if (t >= quantom_time) {
mem_view.add("Context Switch, End Of The Quantum Time, P_ID : " + p.getPid() +"at time :" +simulation.time) ;
p.cycles+=5 ;
if (quantom_time > p.remainngtime) {
p.remainngtime = 0;
p.burst_time += (quantom_time - p.remainngtime);
}
if (p.remainngtime == 0) {
return true;
} else {
return false;
}
}
}
return true;
}
public boolean fifo() {
int t = 0;
for (int i = p.pointer; i < p.traces.size(); i++) {
p.pointer = i;
if (size_in_frames > p.min_frames_per_proc) {
if (!check_proc_in_mem()) {
mem.addLast(new memory(p));
size_in_frames -= p.min_frames_per_proc;
}
} else {
mem.getFirst().getP().cycles += 5;
simulation.ready_queue.addLast(mem.getFirst().getP());
mem.removeFirst();
mem.addLast(new memory(p));
}
if (find_if_in_memory(p.traces.get(i))) {
mem_view.add("hit in memory , page id : " + p.traces.get(i) + "processes id : " + p.getPid());
p.hits++;
} else {
p.cycles += 305;
p.number_of_page_faults++;
p.remainngtime--;
p.burst_time++;
p.pointer++;
if (p.remainngtime==0){
return true ;
}
mem_view.add("page fault , page id : " + p.traces.get(i) + "processes id : " + p.getPid() + " context switch and page " +
"replacement");
if (p.framesinmem.size() < p.min_frames_per_proc) {
p.framesinmem.addLast(new frame(p.traces.get(i), 0));
} else {
p.framesinmem.removeFirst();
p.framesinmem.addLast(new frame(p.traces.get(i), 0));
}
if (p.remainngtime == 0) {
return true;
}
return false;
}
t += 1;
p.remainngtime--;
p.burst_time++;
if (p.remainngtime == 0) {
return true;
}
if (t >= quantom_time) {
if (quantom_time > p.remainngtime) {
p.remainngtime = 0;
p.burst_time += (quantom_time - p.remainngtime);
}
if (p.remainngtime == 0) {
return true;
} else {
return false;
}
}
}
return true;
}
boolean find_if_in_memory(int pagenumber) {
for (frame m : p.framesinmem){
if (pagenumber == m.page_id){
m.bit_referance = 1 ;
return true ;
}
}
return false ;
}
boolean check_proc_in_mem(){
for (memory m : mem){
if (m.getP() == p){
return true ;
}
}
return false ;
}
public procececs_random_data getP() {
return p;
}
public void setP(procececs_random_data p) {
this.p = p;
}
}