-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathprog5.py
329 lines (255 loc) · 11.2 KB
/
prog5.py
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
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
import sys
from math import gcd # Python versions 3.5 and above
#from fractions import gcd # Python versions below 3.5
from functools import reduce # Python version 3.x
import copy
# Find LCM for scheduling time
def lcm(denominators):
return reduce(lambda a,b: a*b // gcd(a,b), denominators)
def setup(f):
# Read file
lines = f.read().splitlines()
print(lines)
num_processes, time_run = lines[0].split(' ')
num_processes = int(num_processes)
time_run = int(time_run)
# processes start at 1
# keep track of number of times it has been run
periods = []
processes={}
priority = []
for i, line in enumerate(lines):
if i == 0:
continue
period, runtime = line.split(' ')
period = int(period)
runtime = int(runtime)
periods.append(period)
priority.append({
"current": 1,
"deadline": period,
"remaining": runtime,
"pid": i,
"period": period,
"runtime": runtime
})
# Calculate priority using period
# Smaller period = higher priority
priority = sorted(priority, key=lambda x: x['period'])
# print(priority)
for p in priority:
pid = p["pid"]
processes[pid] = {
"current": 0,
"deadline": p["period"],
"remaining": p["runtime"],
"pid": pid,
"period": p["period"],
"runtime": p["runtime"]
}
return num_processes, time_run, processes, periods
def get_index(processes, pid):
for idx, p in enumerate(processes):
if p["pid"] == pid:
return idx
return -1
# Rate monotonic scheduling
def rms(processes, t, scheduling_time, w):
# Based on the priority, loop through all processes
totalTime = 0
# Run until stop or failure
remaining_processes = [] # Store the pid
arrivals = []
# print(processes.items())
# processes = sorted(processes.items(), key=lambda x: x['period'])
print(processes)
for p in processes:
arrivals.append( (processes[p]["pid"], processes[p]["period"]) )
current_process = list(processes.keys())[0]
pArrived = False
pCompleted = False
pCompletedPID = -1
pFail = -1
while totalTime <= t:
pArrived = False
pCompleted = False
# Get all arrivals for this time
arrived = []
for pid, period in arrivals:
if totalTime % period == 0:
print("Current time: ", totalTime)
print("Process: ", pid, " period: ", period)
arrived.append(pid)
if len(arrived) > 0:
pArrived = True
# Check if current process has finished / idle
if processes[current_process]["remaining"] <= 0:
print("Remaining: ", remaining_processes)
if processes[current_process]["remaining"] == 0:
pCompleted = True
pCompletedPID = current_process
print("Process ", current_process, "has finished at time ", totalTime)
# Current process has FINISHED, only append to completed process if remaining is 0
# Set remaining to -1
processes[current_process]["remaining"] = -1
# Check if there are any other processes remaining
if len(remaining_processes) > 0:
print("Getting new current process")
current_process = remaining_processes.pop(0)
for pid in arrived:
# Check for failure
if processes[pid]["remaining"] > 0 and totalTime != 0:
print("Remaining: ", processes[pid]["remaining"])
pFail = pid
print("Failure")
# return
# Reset if no failure
processes[pid]["deadline"] = totalTime + processes[pid]["period"]
processes[pid]["current"] += 1
processes[pid]["remaining"] = processes[pid]["runtime"]
# Check if process has run for necessary time
print("Before check for finish")
print(current_process, ": ", processes[current_process]["remaining"])
# Check if current process needs to change
if processes[pid]["period"] < processes[current_process]["period"]:
print("Process ", pid, " is replacing ", current_process, " as current process")
# If current process has yet to complete, add to back of remaining
if processes[current_process]["remaining"] > 0:
remaining_processes.append(current_process)
# If it has already completed, don't do anything
if processes[current_process]["remaining"] <= 0:
print("Process ", current_process, " already finished")
current_process = pid
else:
remaining_processes.append(pid)
if processes[current_process]["remaining"] == -1 and len(remaining_processes) > 0:
current_process = remaining_processes.pop(0)
# Do the actual algorithm
# Remove current pid from remaining if it exists
if current_process in remaining_processes:
remaining_processes.remove(current_process)
# Write to file if process arrived or finished
# Write arrivals to file
# Check for priority
if pCompleted or pArrived:
w.write(str(totalTime))
w.write("\n")
use = current_process
if pCompleted:
# w.write("F: ")
w.write("F: P"+str(pCompletedPID)+"-"+str(processes[pCompletedPID]["current"]))
use = pCompletedPID
if pCompleted and pArrived:
w.write(" ")
if pArrived:
# Check if they have completed their stuff yet
if len(arrived) > 0:
w.write("A:")
for pid in arrived:
if pFail == pid:
w.write(' P' + str(pid) + '-' + str(processes[pid]["current"]) + " FAIL")
else:
w.write(' P' + str(pid) + '-' + str(processes[pid]["current"]))
w.write('\n')
# print(pCompletedPID)
# Write current process
if processes[current_process]["remaining"] != -1:
w.write("P"+str(current_process)+"-"+str(processes[current_process]["current"]) + " (" + str(processes[current_process]["period"]) + ", " + str(processes[current_process]["remaining"]) + ")")
w.write("\n")
# Write all remaining processes
for idx, p in enumerate(remaining_processes):
w.write("P"+str(processes[p]["pid"])+"-"+str(processes[p]["current"]) + " (" + str(processes[p]["period"]) + ", " + str(processes[p]["remaining"]) + ")")
if idx + 1 != len(remaining_processes):
w.write(" ")
w.write("\n")
if pFail != -1:
return
# Increment time and decrement remaining for process
print("Time: ", totalTime)
print("Current process: ", current_process)
print("Process ", current_process, " remaining: ", processes[current_process]["remaining"])
processes[current_process]["remaining"] -= 1
totalTime += 1
def edfs(processes, t, scheduling_time):
# Calculate the priority based on distance to deadline is less
# Based on the priority, loop through all processes
totalTime = 0
# Run until stop or failure
remaining_processes = [] # Store the pid
arrivals = []
print(processes)
for p in processes:
arrivals.append( (processes[p]["pid"], processes[p]["period"]) )
current_process = list(processes.keys())[0]
while totalTime < t:
arrived = []
for pid, period in arrivals:
if totalTime % period == 0:
arrived.append(pid)
# Write arrivals to file
# Check if they have completed their stuff yet
for pid in arrived:
print("Process ", pid, " arrived at time ", totalTime)
if processes[pid]["remaining"] > 0 and totalTime != 0:
print("Failure")
return
else:
processes[pid]["deadline"] = totalTime + processes[pid]["period"]
processes[pid]["current"] += 1
processes[pid]["remaining"] = processes[pid]["runtime"]
# Check for priority
for pid in arrived:
if processes[pid]["deadline"] - totalTime < processes[current_process]["deadline"] - totalTime or processes[current_process]["remaining"] == -1:
print("Process ", pid, " is replacing ", current_process, " as current process")
# print("Incoming process deadline: ", processes[pid]["deadline"])
# print("Current deadline: ", processes[current_process]["deadline"])
if processes[current_process]["remaining"] > 0:
# print("Remaininng for process ", current_process, " :", processes[current_process]["remaining"])
remaining_processes.append(current_process)
if processes[current_process]["remaining"] <= 0:
print("Process ", current_process, " already finished")
print(remaining_processes)
current_process = pid
else:
remaining_processes.append(pid)
# Do the actual algorithm
# Remove current pid from remaining if it exists
if current_process in remaining_processes:
remaining_processes.remove(current_process)
# Run this process once
# print("Time ", totalTime, ": Process ", current_process)
# print("Process ", current_process, " remaining -1")
processes[current_process]["remaining"] = processes[current_process]["remaining"]-1
totalTime += 1
# Check if process has run for necessary time
if processes[current_process]["remaining"] <= 0:
# print("Remaining: ", remaining_processes)
if processes[current_process]["remaining"] == 0:
print("Process ", current_process, "has finished at time ", totalTime)
# Current process has FINISHED, only append to completed process if remaining is 0
# Set remaining to -1
processes[current_process]["remaining"] = -1
# Check if there are any other processes remaining
if len(remaining_processes) > 0:
# print("Getting new current process")
current_process = remaining_processes.pop(0)
def main():
filename = sys.argv[1]
try:
# Open file for reading
f = open('./'+filename, 'r')
except:
# File does not exist
print("No file named ", filename, " in current directory")
w = open("output.txt", "w")
# Read in file
num_processes, time_run, priority, periods = setup(f)
p1 = copy.deepcopy(priority)
p2 = copy.deepcopy(priority)
scheduling_time = lcm(periods)
rms(p1, time_run,scheduling_time, w)
w.write("\n")
edfs(p2, time_run,scheduling_time, w)
# Create file for writing output
# output = open("output.txt", "a")
main()