-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathround_robin.txt
84 lines (67 loc) · 2.53 KB
/
round_robin.txt
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
#include <iostream>
#include <vector>
using namespace std;
struct Process {
int id;
int arrivalTime;
int burstTime;
int remainingTime;
int turnaroundTime;
int waitingTime;
};
void roundRobinScheduling(vector<Process>& processes, int timeQuantum) {
int n = processes.size();
int currentTime = 0;
bool isCompleted = false;
while (!isCompleted) {
isCompleted = true;
for (int i = 0; i < n; i++) {
if (processes[i].remainingTime > 0) {
isCompleted = false;
if (processes[i].remainingTime > timeQuantum) {
currentTime += timeQuantum;
processes[i].remainingTime -= timeQuantum;
} else {
currentTime += processes[i].remainingTime;
processes[i].remainingTime = 0;
processes[i].turnaroundTime = currentTime - processes[i].arrivalTime;
processes[i].waitingTime = processes[i].turnaroundTime - processes[i].burstTime;
}
}
}
}
}
int main() {
int n;
cout << "Enter the number of processes: ";
cin >> n;
vector<Process> processes(n);
for (int i = 0; i < n; i++) {
cout << "Process " << i + 1 << ":" << endl;
cout << "Enter arrival time: ";
cin >> processes[i].arrivalTime;
cout << "Enter burst time: ";
cin >> processes[i].burstTime;
processes[i].id = i + 1;
processes[i].remainingTime = processes[i].burstTime;
}
int timeQuantum;
cout << "Enter time quantum: ";
cin >> timeQuantum;
roundRobinScheduling(processes, timeQuantum);
cout << "Process\tArrival Time\tBurst Time\tTurnaround Time\tWaiting Time" << endl;
double totalTurnaroundTime = 0;
double totalWaitingTime = 0;
for (int i = 0; i < n; i++) {
cout << processes[i].id << "\t" << processes[i].arrivalTime << "\t\t"
<< processes[i].burstTime << "\t\t" << processes[i].turnaroundTime << "\t\t"
<< processes[i].waitingTime << endl;
totalTurnaroundTime += processes[i].turnaroundTime;
totalWaitingTime += processes[i].waitingTime;
}
double averageTurnaroundTime = totalTurnaroundTime / n;
double averageWaitingTime = totalWaitingTime / n;
cout << "Average Turnaround Time: " << averageTurnaroundTime << endl;
cout << "Average Waiting Time: " << averageWaitingTime << endl;
return 0;
}