-
Notifications
You must be signed in to change notification settings - Fork 0
/
SortedNoDTQ.cpp
108 lines (84 loc) · 2.93 KB
/
SortedNoDTQ.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
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
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
// Finding the waiting time
void findWaitingTime(int processes[], int n, int bt[], int wt[], int quantum){
// Create copies of burst time to calculate reminder burst time
int rem_bt[n];
for (int i = 0 ; i < n ; i++){
rem_bt[i] = bt[i];
}
// All processes' arrival time
int t = 0;
// Traverse through all processes until finish
while (1){
bool done = true;
for (int i = 0 ; i < n; i++){
// If burst time is greater than 0, continue process
if (rem_bt[i] > 0){
done = false;
// If burst time is more than time quantum
if (rem_bt[i] > quantum){
t += quantum; // Increase time elapsed based on time quantum
rem_bt[i] -= quantum; // Remaining burst time
}
// Else if it does not -- increase time elapsed based on burst time
else{
t = t + rem_bt[i]; // Increase time elapsed based on burst time
wt[i] = t - bt[i]; // Waiting time = current time - burst time
rem_bt[i] = 0;
}
}
}
// When all processes are done
if (done == true){
break;
}
}
}
// Calculate turn around time from burst time and waiting time
void findTurnAroundTime(int processes[], int n, int bt[], int wt[], int tat[]){
for (int i = 0; i < n ; i++){
tat[i] = bt[i] + wt[i];
}
}
// Calculate and show average waiting time and turn around time
void findavgTime(int processes[], int n, int bt[], int quantum){
int wt[n], tat[n], total_wt = 0, total_tat = 0;
findWaitingTime(processes, n, bt, wt, quantum);
findTurnAroundTime(processes, n, bt, wt, tat);
cout << "PN\t " << " \tBT " << " WT " << " \tTAT\n";
for (int i=0; i<n; i++){
total_wt = total_wt + wt[i];
total_tat = total_tat + tat[i];
cout << " " << i+1 << "\t\t" << bt[i] <<"\t " << wt[i] <<"\t\t " << tat[i] <<endl;
}
cout << "Average waiting time = " << (float)total_wt / (float)n;
cout << "\nAverage turn around time = " << (float)total_tat / (float)n;
}
int main() {
// Define amount of processes
int n;
cout << "Insert amount of processes: ";
cin >> n;
// Define all processes' ID
int processes[n];
for (int i = 0; i < n; i++){
cout << "Insert process' ID: ";
cin >> processes[i];
}
// Define all processes' burst time
int burst_time[n];
for (int i = 0; i < n; i++){
cout << "Insert process' burst times: ";
cin >> burst_time[i];
}
// Sort the burst times
sort(burst_time, burst_time+n);
// Define time quantum
int quantum;
cout << "Insert time quantum: ";
cin >> quantum;
findavgTime(processes, n, burst_time, quantum);
return 0;
}