-
Notifications
You must be signed in to change notification settings - Fork 0
/
UniProgrammed.java
174 lines (154 loc) · 6.45 KB
/
UniProgrammed.java
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
import java.util.*;
/*
*
* @Course : Operating Systems , Lab 2
* @Author : Sanchit Mehta<[email protected]>
* @Desc: UniProgrammed Implementation
*
*/
public class UniProgrammed {
ArrayList<Process> procs;
ArrayList<Process> notStartedQ = new ArrayList<Process>();
Queue<Process> readyQ = new LinkedList<>();
ArrayList<Process> blockedQ= new ArrayList<Process>();
ArrayList<Process> finishedQ = new ArrayList<Process>();
int cycleCount = 0;
int cpuTime = 0;
int ioTime = 0;
int finishedCount = 0;
boolean detailedOP = false;
public UniProgrammed(ArrayList<Process> procs,boolean detailedOP){
this.detailedOP = detailedOP;
this.procs = procs;
int numProcs = procs.size();
System.out.print("The original input was: "+numProcs);
for(int i=0;i<procs.size();i++) {
Process p = procs.get(i);
System.out.print(" ("+p.arrivalTime+" "
+p.burstTime+" "
+p.totalCPUTime+" "
+p.multiplier+") ");
}
System.out.println();
Collections.sort(procs);
System.out.print("The (sorted) input is: "+numProcs);
for(int i=0;i<procs.size();i++) {
Process p = procs.get(i);
System.out.print(" ("+p.arrivalTime+" "
+p.burstTime+" "
+p.totalCPUTime+" "
+p.multiplier+") ");
}
cycleCount = 0;
Process currRunningProc = null;
System.out.println("\n\n");
for(int i=0;i<numProcs;i++)
notStartedQ.add(procs.get(i));
if(detailedOP)
printProcessState(numProcs);
//While all processes have not finished execution
//clock goes tick tock tick tock
while(finishedCount<numProcs){
//put unstarted process into ready
//since unstarted is sorted by arrtime, we'll only
//check the list head
boolean flag = false;
ArrayList<Process> toBeRemoved = new ArrayList<>();
for(Process p:notStartedQ){
if(p.arrivalTime == cycleCount){
readyQ.add(p);
flag=true;
toBeRemoved.add(p);
}
}
if(flag) {
for(Process p:toBeRemoved)
notStartedQ.remove(p);
}
//no running process, getting a process to run from ready
if(currRunningProc == null&&blockedQ.isEmpty()){
currRunningProc = readyQ.remove();
currRunningProc.setRandomBurstForCPU();
}
cycleCount++;
if(detailedOP)
printProcessState(numProcs);
if(currRunningProc!=null){
currRunningProc.addRunTimes();
cpuTime++;
}
for(Process p:readyQ){
p.waitingTime++;
}
if(!blockedQ.isEmpty()){
ioTime++;
Process[] blockedProcs = blockedQ.toArray(new Process [0]);
for(int i=0;i<blockedProcs.length;i++){
blockedProcs[i].ioTime++;
blockedProcs[i].currIOBurst--;
if(blockedProcs[i].currIOBurst == 0){
currRunningProc = blockedProcs[i];
currRunningProc.setRandomBurstForCPU();
blockedQ.remove(blockedProcs[i]);
}
}
}
if(currRunningProc!=null){
if(currRunningProc.totalCPUTimeRemaining==0){
finishedCount++;
currRunningProc.finishingTime = cycleCount;
finishedQ.add(currRunningProc);
currRunningProc=null;
}else if(currRunningProc.totalCPUTimeRemaining>0&&
currRunningProc.currCPUBurst<=0){
blockedQ.add(currRunningProc);
currRunningProc=null;
}
}
}
System.out.println("\n\nThe scheduling algorithm used was Uniprocessing\n\n");
Collections.sort(procs,new CompareByArrivalTime());
float turnaround=0;
float waiting=0;
for(int i=0;i<procs.size();i++) {
Process p = procs.get(i);
System.out.println("\n");
System.out.println("Process "+i+":");
System.out.println("\t(A,B,C,M) = ("+p.arrivalTime+","
+p.burstTime+","
+p.totalCPUTime+","
+p.multiplier+")");
System.out.println("\tFinishing time: "+p.finishingTime);
System.out.println("\tTurnaround time: "+(p.finishingTime-p.arrivalTime));
System.out.println("\tI/O time: "+p.ioTime);
System.out.println("\tWaiting time: "+p.waitingTime);
turnaround+=(p.finishingTime-p.arrivalTime);
waiting+=p.waitingTime;
p.clear();
}
System.out.println("\n\nSummary Data: ");
System.out.println("\tFinishing time: "+cycleCount);
System.out.println("\tCPU Utilization: "+String.format("%.6f",(float)cpuTime/cycleCount));
System.out.println("\tI/O Utilization: "+String.format("%.6f",(float)ioTime/cycleCount));
System.out.println("\tThroughput: "+String.format("%.6f",(((float)numProcs/(float)cycleCount)*100))+" processes per hundred cycles");
System.out.println("\tAverage turnaround time: "+String.format("%.6f",(float)(turnaround/numProcs)));
System.out.println("\tAverage waiting time: "+String.format("%.6f",(float)(waiting/numProcs)));
Process.randomGenerator.resetPtr();
}
public void printProcessState(int numProcs){
System.out.print("Before cycle:\t"+cycleCount+" ");
for(int i=0;i<numProcs;i++){
if(blockedQ.contains(procs.get(i)))
System.out.print("\tblocked "+procs.get(i).currIOBurst);
else if(readyQ.contains(procs.get(i)))
System.out.print("\tready 0");
else if(finishedQ.contains(procs.get(i)))
System.out.print("\tterminated ");
else if(notStartedQ.contains(procs.get(i)) && cycleCount <= procs.get(i).arrivalTime)
System.out.print("\tunstarted 0");
else
System.out.print("\trunning "+((1+procs.get(i).currCPUBurst)-1));
}
System.out.println(".");
}
}