-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path4CPU_SchedulerEmulation.cpp
More file actions
257 lines (221 loc) · 7.03 KB
/
Copy path4CPU_SchedulerEmulation.cpp
File metadata and controls
257 lines (221 loc) · 7.03 KB
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
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
//read process file in while it is not at the end
#include <iostream>
#include <cstddef>
#include <fstream>
#include <queue>
#include <sstream>
const int QUANTUM = 4;
struct Job
{
int name;
int arrivalTime;
int blastTime;
};
//Initialize Job queue
std::queue<Job> jobqueue;
std::queue<Job> waitqueue;
//initialize cpuQueues
std::queue<Job> cpuQueue1;
std::queue<Job> cpuQueue2;
std::queue<Job> cpuQueue3;
std::queue<Job> cpuQueue4;
int main(void)
{
//Import data
std::string line;
std::ifstream jobFile("job.txt");
if(jobFile.is_open())
{
Job tmp;
std::string line;
int i = 0;
char delimiter = ',';
while(!(jobFile.eof()))
{
if(i == 0)
{
std::getline(jobFile, line, delimiter);
//std::cout<<line<<std::endl;
int number;
std::istringstream iss (line);
iss >> number;
tmp.name = number;
i++;
}
else if(i == 1)
{
std::getline(jobFile, line, delimiter);
//std::cout<<line<<std::endl;
int number;
std::istringstream iss (line);
iss >> number;
tmp.arrivalTime = number;
i++;
}
else
{
std::getline(jobFile, line);
//std::cout<<line<<std::endl;
int number;
std::istringstream iss (line);
iss >> number;
tmp.blastTime = number;
jobqueue.push(tmp);
i = 0;
}
}
}
else
{
std::cout<<"job.txt failed to open"<<std::endl;
return -1;
}
//Close file
jobFile.close();
//////////////////////////////////////////////////////////
// Total Processes cycle counter
int counter = 0;
int j = 0;
while(jobqueue.front().arrivalTime <= counter)
{
waitqueue.push(jobqueue.front());
jobqueue.pop();
}
// initial population of cpuQueues. populate each with 1 job
cpuQueue1.push(waitqueue.front());
waitqueue.pop();
cpuQueue2.push(waitqueue.front());
waitqueue.pop();
cpuQueue3.push(waitqueue.front());
waitqueue.pop();
cpuQueue4.push(waitqueue.front());
waitqueue.pop();
int timeSlice1 = 0; //tracks usage of time slice
int timeSlice2 = 0;
int timeSlice3 = 0;
int timeSlice4 = 0;
//Proccess data while any queue still has jobs in it
while(!jobqueue.empty() || !waitqueue.empty() || !cpuQueue1.empty() || !cpuQueue2.empty() || !cpuQueue3.empty() || !cpuQueue4.empty()) //While there are still jobs in jobqueue or cpuQueue1 has jobs
{
//Process: decrement blasttime by 1
cpuQueue1.front().blastTime = cpuQueue1.front().blastTime -1;
cpuQueue2.front().blastTime = cpuQueue2.front().blastTime -1;
cpuQueue3.front().blastTime = cpuQueue3.front().blastTime -1;
cpuQueue4.front().blastTime = cpuQueue4.front().blastTime -1;
//increment time counter and timeSlice1
counter++;
timeSlice1++;
timeSlice2++;
timeSlice3++;
timeSlice4++;
//Get all new jobs from job queue if it is not empty
if(!jobqueue.empty())
{
while(jobqueue.front().arrivalTime <= counter && !jobqueue.empty())
{
//std::cout<<"added Job: "<<jobqueue.front().name<<" to waitQ"<<std::endl;
waitqueue.push(jobqueue.front());
jobqueue.pop();
}
}
//OUTPUT and reassignment
//When jobs are finished or time slice is up, place a new job in queue and print results
if(cpuQueue1.front().blastTime == 0 || timeSlice1 == QUANTUM)
{
if(cpuQueue1.front().blastTime <= 0)//job completed
{
//print: name, completionTime (counter), and Finished?? Check assignment sheet
std::cout<<"Job "<<cpuQueue1.front().name<<", scheduled for "<<timeSlice1 + 1<<"ms, completed"<<std::endl;
cpuQueue1.pop(); //remove job from queue
}
else
{
//print name, completionTime (counter)?? Check assignment sheet
std::cout<<"Job "<<cpuQueue1.front().name<<", scheduled for "<<timeSlice1 + 1<<"ms"<<std::endl;
//Place job in back of waitqueue and remove from front
waitqueue.push(cpuQueue1.front());
cpuQueue1.pop();
}
//if wait queue is not empty & cpu queue is empty and the next job has arrived
if(!waitqueue.empty() && cpuQueue1.empty())
{
cpuQueue1.push(waitqueue.front());
waitqueue.pop();
}
timeSlice1 = 0;
}
if(cpuQueue2.front().blastTime == 0 || timeSlice2 == QUANTUM)
{
if(cpuQueue2.front().blastTime <= 0)//job completed
{
//print: name, completionTime (counter), and Finished?? Check assignment sheet
std::cout<<"Job "<<cpuQueue2.front().name<<", scheduled for "<<timeSlice2 + 1<<"ms, completed"<<std::endl;
cpuQueue2.pop(); //remove job from queue
}
else
{
//print name, completionTime (counter)?? Check assignment sheet
std::cout<<"Job "<<cpuQueue2.front().name<<", scheduled for "<<timeSlice2 + 1<<"ms"<<std::endl;
//Place job in back of waitqueue and remove from front
waitqueue.push(cpuQueue2.front());
cpuQueue2.pop();
}
//if wait queue is not empty & cpu queue is empty and the next job has arrived
if(!waitqueue.empty() && cpuQueue2.empty())
{
cpuQueue2.push(waitqueue.front());
waitqueue.pop();
}
timeSlice2 = 0;
}
if(cpuQueue3.front().blastTime == 0 || timeSlice3 == QUANTUM)
{
if(cpuQueue3.front().blastTime <= 0)//job completed
{
//print: name, completionTime (counter), and Finished?? Check assignment sheet
std::cout<<"Job "<<cpuQueue3.front().name<<", scheduled for "<<timeSlice3 + 1<<"ms, completed"<<std::endl;
cpuQueue3.pop(); //remove job from queue
}
else
{
//print name, completionTime (counter)?? Check assignment sheet
std::cout<<"Job "<<cpuQueue3.front().name<<", scheduled for "<<timeSlice3 + 1<<"ms"<<std::endl;
//Place job in back of waitqueue and remove from front
waitqueue.push(cpuQueue3.front());
cpuQueue3.pop();
}
//if wait queue is not empty & cpu queue is empty and the next job has arrived
if(!waitqueue.empty() && cpuQueue3.empty())
{
cpuQueue3.push(waitqueue.front());
waitqueue.pop();
}
timeSlice3 = 0;
}
if(cpuQueue4.front().blastTime == 0 || timeSlice4 == QUANTUM)
{
if(cpuQueue4.front().blastTime <= 0)//job completed
{
//print: name, completionTime (counter), and Finished?? Check assignment sheet
std::cout<<"Job "<<cpuQueue4.front().name<<", scheduled for "<<timeSlice4 + 1<<"ms, completed"<<std::endl;
cpuQueue4.pop(); //remove job from queue
}
else
{
//print name, completionTime (counter)?? Check assignment sheet
std::cout<<"Job "<<cpuQueue4.front().name<<", scheduled for "<<timeSlice4 + 1<<"ms"<<std::endl;
//Place job in back of waitqueue and remove from front
waitqueue.push(cpuQueue4.front());
cpuQueue4.pop();
}
//if wait queue is not empty & cpu queue is empty and the next job has arrived
if(!waitqueue.empty() && cpuQueue4.empty())
{
cpuQueue4.push(waitqueue.front());
waitqueue.pop();
}
timeSlice4 = 0;
}
}
std::cout<<"Total CPU Cycles: "<<counter - 1<<std::endl;
}