-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathSJF.cpp
74 lines (71 loc) · 2.12 KB
/
SJF.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
#include <iostream>
using namespace std;
class Process {
public:
int pid, at, bt, ct, tat, wt, rt;
bool done;
};
class SJF {
private:
int n, time;
Process processes[10];
public:
SJF() {
time = 0;
}
void inputDetails() {
cout << "Enter the number of processes: ";
cin >> n;
cout << "Enter the arrival time and burst time of each process:\n";
for (int i = 0; i < n; i++) {
cin >> processes[i].at >> processes[i].bt;
processes[i].pid = i + 1;
processes[i].done = false;
}
}
void sortProcesses() {
Process temp;
for (int i = 1; i < n; i++) {
temp = processes[i];
int j = i - 1;
while (j >= 0 && processes[j].bt > temp.bt) {
processes[j + 1] = processes[j];
j--;
}
processes[j + 1] = temp;
}
}
void schedule() {
int e = 0, doneCount = 0, found;
while (doneCount != n) {
found = 0;
for (int i = 0; i < n; i++) {
if (processes[i].at <= time && !processes[i].done) {
e = i;
found = 1;
break;
}
}
if (!found) {
time += 1;
continue;
}
processes[e].rt = time - processes[e].at;
time += processes[e].bt;
processes[e].ct = time;
processes[e].tat = processes[e].ct - processes[e].at;
processes[e].wt = processes[e].tat - processes[e].bt;
processes[e].done = true;
doneCount += 1;
cout << processes[e].pid << "\t" << processes[e].at << "\t" << processes[e].bt << "\t" << processes[e].ct << "\t" << processes[e].tat << "\t" << processes[e].wt << "\t" << processes[e].rt << endl;
}
}
};
int main() {
SJF sjf;
sjf.inputDetails();
sjf.sortProcesses();
cout << "PID\tAT\tBT\tCT\tTAT\tWT\tRT\n";
sjf.schedule();
return 0;
}