-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathPriorityPreemtive.java
More file actions
137 lines (111 loc) · 4.44 KB
/
PriorityPreemtive.java
File metadata and controls
137 lines (111 loc) · 4.44 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
int pid;
int at;
int bt;
int remainingTime;
int priority;
int completionTime;
int waitingTime;
int turnAroundTime;
public Process2(int id, int at,int bt,int p) {
this.processID = id;
this.arrivalTime = at;
this.burstTime = bt;
this.remainingTime = bt;
this.priority = priority;
}
}
public class PriorityPreemtive {
public static int getRandom() {
return (int) Math.floor(Math.random() 25);
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("Enter the number of processes:");
int n = sc.nextInt();
Process2[] processes = new Process2[n];
for (int i = 0; i < n; i++) {
int at= getRandom();
int bt= getRandom();
int priority = getRandom(); // Higher number means lower priority
processes[i] = new Process2(i + 1, at,bt, priority);
}
Arrays.sort(processes, Comparator.comparingInt(p -> p.arrivalTime));
int currentTime = 0;
int completed = 0;
int tWT = 0, tTAT = 0;
int prevProcess = -1;
List<Integer> ganttProcess = new ArrayList<>();
List<Integer> ganttTimes = new ArrayList<>();
while (completed < n) {
int idx = -1;
int highestPriority = Integer.MAX_VALUE;
for (int i = 0; i < n; i++) {
if (processes[i].arrivalTime <= currentTime && processes[i].remainingTime > 0 &&
processes[i].priority < highestPriority) {
highestPriority = processes[i].priority;
idx = i;
}
}
if (idx != -1) {
Process2 currentProcess = processes[idx];
if (prevProcess != currentProcess.pid) {
ganttProcess.add(currentProcess.pid);
ganttTimes.add(currentTime);
prevProcess = currentProcess.pid;
}
currentProcess.remainingTime--;
currentTime++;
if (currentProcess.remainingTime == 0) {
currentProcess.completionTime = currentTime;
currentProcess.turnAroundTime = currentProcess.completionTime - currentProcess.at;
currentProcess.waitingTime = currentProcess.turnAroundTime - currentProcess.bt;
totalWaitingTime += currentProcess.waitingTime;
totalTurnAroundTime += currentProcess.turnAroundTime;
completed++;
}
} else {
if (ganttProcess.isEmpty() || ganttProcess.get(ganttProcess.size() - 1) != 0) {
ganttProcess.add(0);
ganttTimes.add(currentTime);
}
currentTime++;
}
}
ganttTimes.add(currentTime);
System.out.println("|\tP\t|\tBT\t|\tAT\t|\tPr\t|\tCT\t|\tWT\t|\tTAT\t|");
for (Process2 process : processes) {
System.out.println("|\tP" + process.pid + "\t|\t" + process.bt + "\t|\t" +
process.at + "\t|\t" + process.priority + "\t|\t" +
process.completionTime + "\t|\t" + process.waitingTime + "\t|\t" +
process.turnAroundTime + "\t|");
}
System.out.println("\nAverage Waiting Time: " + (float) totalWaitingTime / n);
System.out.println("Average Turnaround Time: " + (float) totalTurnAroundTime / n);
System.out.println("\nGantt Chart:");
System.out.print("+");
for(int i = 0; i < ganttProcess.size(); i++){
System.out.print("--------");
}
System.out.print("+");
System.out.print("\n|");
for (int i = 0; i < ganttProcess.size(); i++) {
if (ganttProcess.get(i) == 0) {
System.out.print(" IDLE |");
} else {
System.out.print("\tP" + ganttProcess.get(i) + "\t|");
}
}
System.out.println();
System.out.print("+");
for(int i = 0; i < ganttProcess.size(); i++){
System.out.print("--------");
}
System.out.print("+");
System.out.print("\n" + ganttTimes.get(0));
for (int i = 1; i < ganttTimes.size(); i++) {
System.out.print("\t\t" + ganttTimes.get(i));
}
System.out.println();
scanner.close();
}
}