-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTheProblemWithLowLevel.cpp
More file actions
212 lines (192 loc) · 5.83 KB
/
TheProblemWithLowLevel.cpp
File metadata and controls
212 lines (192 loc) · 5.83 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
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <ostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
typedef struct Process {
enum State { READY, RUNNING, BLOCKED, TERMINATED };
std::string procName;
size_t arrivalTime;
size_t burstTimeCPU;
size_t burstTimeIO;
size_t burstTimeRate;
size_t startTime = SIZE_MAX;
size_t completionTime;
size_t burstRemainCPU = SIZE_MAX;
size_t lastIOBurst;
State state;
Process() {}
Process(std::string&& name,
size_t at,
size_t btCPU,
size_t btIO,
size_t btr) {
procName = std::move(name);
arrivalTime = at;
burstTimeCPU = btCPU;
burstRemainCPU = btCPU;
burstTimeIO = btIO;
burstTimeRate = btr;
}
State exec() {
state = State::RUNNING;
if (--burstRemainCPU <= 0) {
state = State::TERMINATED;
} else if (++lastIOBurst >= burstTimeRate) {
refreshIOBurst();
state = State::BLOCKED;
}
return state;
}
void refreshIOBurst() { lastIOBurst = 0; }
size_t turnAroundTime() { return completionTime - arrivalTime; }
size_t waitingTime() { return turnAroundTime() - burstTimeCPU; }
size_t responseTime() { return startTime - arrivalTime; }
} Process;
typedef std::vector<Process> Processes;
class Device {
public:
Device() : readyQ(cmp), ioQ(cmp) {}
void init(Processes& procs) {
this->procs = procs;
totalProc = procs.size();
}
void start() { processor(); }
#define LOG(tick, device, procData) \
std::cout << tick << "\t" << device << "\t\t" << procData << "\t\t" \
<< "\n";
#define LOG_TICK() std::cout << ticksCPU;
void processor() {
Process execProc;
LOG("Time (tick)", "Device", "Process Served")
while (totalProc) {
LOG_TICK()
if (isCPUIdle) {
LOG("\t", "CPU", "-");
}
FreshArrivals();
if (!isCPUIdle) {
execProc.exec();
if (execProc.state == Process::State::TERMINATED) {
LOG("\t", "CPU", execProc.procName << "[Comp]");
isCPUIdle = true;
totalProc--;
execProc.completionTime = ticksCPU;
completedProcs.push_back(execProc);
execProc = {};
} else if (execProc.state == Process::State::BLOCKED) {
LOG("\t", "CPU",
execProc.procName << "[Q IO]:" << execProc.burstRemainCPU);
ioQ.push(execProc);
isCPUIdle = true;
execProc = {};
} else {
LOG("\t", "CPU", execProc.procName << ":" << execProc.burstRemainCPU)
}
}
bool toSchedule =
!readyQ.empty() &&
(isCPUIdle || readyQ.top().burstRemainCPU < execProc.burstRemainCPU);
if (toSchedule) {
auto proc = readyQ.top();
LOG("\t", "CPU", proc.procName << "[Sched]")
readyQ.pop();
readyQ.push(execProc);
execProc = proc;
execProc.startTime = std::min(execProc.startTime, ticksCPU);
isCPUIdle = false;
std::cout << "\n";
}
ioDevice();
ticksCPU++;
std::cout << "\n";
}
}
void ioDevice() {
if (!isIOIdle) {
if (++countIOBurst >= execProcIO.burstTimeIO) {
std::cout << "\t\t" << "IO" << "\t\t" << execProcIO.procName
<< "[Comp]:" << countIOBurst << "\t\t" << "\n";
readyQ.push(execProcIO);
execProcIO = {};
isIOIdle = true;
} else {
std::cout << "\t\t" << "IO" << "\t\t" << execProcIO.procName << ":"
<< countIOBurst << "\t\t"
<< "\n";
}
}
if (isIOIdle && !ioQ.empty()) {
execProcIO = ioQ.top();
ioQ.pop();
std::cout << "\t\t" << "IO" << "\t\t" << execProcIO.procName
<< "[Sched]:" << countIOBurst << "\t\t" << "\n";
countIOBurst = 0;
isIOIdle = false;
}
}
void debug() {
for (auto& proc : completedProcs) {
std::cout << proc.procName << ":\n\t\tStart time:\t\t" << proc.startTime
<< "\n\t\tResponse Time:\t\t" << proc.responseTime()
<< "\n\t\tCompletion time:\t" << proc.completionTime
<< "\n\t\tTurnaround Time:\t" << proc.turnAroundTime()
<< "\n\t\tWaiting Time:\t\t" << proc.waitingTime() << "\n";
}
std::cout << "Avg Waiting Time: " << avgWaitingTime() << "\n";
}
double avgWaitingTime() {
double sum = 0;
for (auto& proc : completedProcs) {
sum += proc.waitingTime();
}
return (double)(sum / completedProcs.size());
}
private:
Processes completedProcs = {};
Processes procs = {};
size_t totalProc = 0;
size_t ticksCPU = 0;
bool isCPUIdle = true;
size_t countIOBurst = 0;
bool isIOIdle = true;
Process execProcIO;
inline static auto cmp = [](const Process& left, const Process& right) {
if (left.burstRemainCPU != right.burstRemainCPU)
return left.burstRemainCPU > right.burstRemainCPU;
return left.arrivalTime > right.arrivalTime;
};
std::priority_queue<Process, Processes, decltype(cmp)> readyQ;
std::priority_queue<Process, Processes, decltype(cmp)> ioQ;
void FreshArrivals() {
int index = 0;
for (auto& proc : procs) {
if (proc.arrivalTime == ticksCPU) {
std::cout << "\t\t" << "CPU" << "\t\t" << proc.procName
<< "[Arrive]\t\t" << "\n";
proc.state = Process::State::READY;
readyQ.push(proc);
procs.erase(procs.begin() + index);
continue;
}
index++;
}
}
};
int main() {
Processes procs;
procs.push_back(Process("P0", 0, 24, 2, 5));
procs.push_back(Process("P1", 3, 17, 3, 6));
procs.push_back(Process("P2", 8, 50, 2, 5));
procs.push_back(Process("P3", 15, 10, 3, 6));
Device d;
d.init(procs);
// d.processor(); // Program Terminates
d.start(); // Program Doesn't Terminate (kind of)
d.debug();
return 0;
}