-
Notifications
You must be signed in to change notification settings - Fork 0
/
opt_sched2_more.py
265 lines (207 loc) · 10.6 KB
/
opt_sched2_more.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
'''
In this one, I try Stage 2 one pipe only once and apply sequentially from first producer to last consumer and then come back again.
-- This is more optimized version to make tasksets harmonic
'''
from timeit import default_timer as timer
import task_generator as task_gen
import numpy as np
import math
import matplotlib.pyplot as plt
import sys, os, pickle
from utility import *
from pipeline import *
import copy, random
num_iterations = 0
def optimize_alpha(single_set, budgets, equal_period, e2e_delay, starting_alpha=1.7, ending_alpha=2.0):
global num_iterations
num_iterations = 0
alpha = starting_alpha
step = 0.01
schedulable = False
# print ("------", sum(budgets), e2e_delay, (float(e2e_delay) / sum(budgets)) / len(budgets))
while alpha <= ending_alpha and not schedulable:
increased_period = int(alpha * equal_period)
taskset = [(b, increased_period) for b in budgets]
is_second_stage_sched = False
# the following variable keeps track of whether at least one pipe was changed.
at_least_one_pipe_changed = False
# If a stretched Pipeline is not schedulable then break
# if not utilization_bound_test(taskset):
# break
num_iterations += 1
while True:
for i in range(0, len(taskset) - 1):
producer = taskset[i]
consumer = taskset[i + 1]
# print ("Iter ", i, taskset)
taskset2 = copy.deepcopy(taskset)
if producer[0] < (producer[1] // 2) and consumer[0] * 2 < consumer[1]:
# period of the producer is halved
producer = (producer[0], producer[1] // 2)
# budget of the consumer is doubled
consumer = (consumer[0] * 2, consumer[1])
taskset2[i] = producer
taskset2[i + 1] = consumer
if utilization_bound_test(taskset2):
taskset = copy.deepcopy(taskset2)
# print ("2nd U:", get_total_util(taskset2), end_to_end_delay_durr(taskset2), loss_rate_ub(taskset, budgets))
# print (taskset2)
at_least_one_pipe_changed = True
i += 1
# print (taskset, get_total_util(taskset))
if end_to_end_delay_durr(taskset) <= e2e_delay:
# print ("Under e2e_delay threshold")
# print (taskset)
schedulable = True
is_second_stage_sched = True
print ("Second Stage Sched, E2E: ", end_to_end_delay_durr(taskset))
print (taskset)
return 2 # Second stage Schedulable
elif get_total_util(taskset2) <= 1.0:
# print ("Util Failed Second: ", get_total_util(taskset2))
# print (taskset2)
new_taskset = make_taskset_harmonic(taskset2)
# print (new_taskset, get_total_util(new_taskset), utilization_bound_test(new_taskset))
if utilization_bound_test(new_taskset):
# print("Make util pass")
# print (new_taskset, get_total_util(new_taskset))
taskset = copy.deepcopy(new_taskset)
at_least_one_pipe_changed = True
if end_to_end_delay_durr(taskset) <= e2e_delay:
# print ("Under e2e_delay threshold")
# print (taskset)
schedulable = True
is_second_stage_sched = True
print ("Second Stage Sched, E2E: ", end_to_end_delay_durr(taskset))
print (taskset)
return 2 # Second stage Schedulable
# if it is already schedulable do not tune another task
if is_second_stage_sched:
break
elif not at_least_one_pipe_changed:
break
elif at_least_one_pipe_changed:
#change back the value to false
at_least_one_pipe_changed = False
if is_second_stage_sched:
break
# Third Stage
if utilization_bound_test(taskset):
# print ("Third Stage", taskset)
#Step 5
for i in range(len(taskset) - 1, -1, -1):
cur_budget = int(taskset[i][0])
cur_period = int(taskset[i][1])
initial_budget = int(single_set[i][0])
# print (cur_budget, cur_period, initial_budget)
while cur_budget // 2 >= initial_budget:
cur_budget = cur_budget // 2
cur_period = cur_period // 2
# print ("Halved budget and period")
taskset[i] = (cur_budget, cur_period)
if utilization_bound_test(taskset) and end_to_end_delay_durr(taskset) <= e2e_delay:
# print ("Third Stage Schedulable and under threshold")
# print (taskset, end_to_end_delay_durr(taskset), 100 * get_total_util(taskset))
schedulable = True
# print ("Scheduling Alpha: :", alpha)
# sys.exit(1)
return 3
elif get_total_util(taskset) <= 1.0 and end_to_end_delay_durr(taskset) <= e2e_delay:
# print ("Util Rejected: ", 100 * get_total_util(taskset))
# print (taskset)
harm_taskset = make_taskset_harmonic(taskset)
taskset = harm_taskset
# # print (harm_taskset, get_total_util(harm_taskset))
# # print ("Harm ", harm_taskset)
# if utilization_bound_test(harm_taskset) and end_to_end_delay_durr(harm_taskset) <= e2e_delay:
# # print ("Harmonic Schedulable and under Threshold")
# # print (harm_taskset, end_to_end_delay_durr(harm_taskset), 100 * get_total_util(harm_taskset))
# schedulable = True
# # sys.exit(1)
# return 3
# sys.exit(1)
alpha = alpha + step
return 0
def main():
global num_iterations
accepted_num_iterations = []
accepted_time_taken = []
rejected_time_taken = []
no_tasks = 5
no_tasksets = 1000
total_util = 0.75
stretch_factor = 1.5
e2e_delay_factor = no_tasks * stretch_factor
alpha = 1.5
min_period = 100
max_period = 1000
utils_sets = task_gen.gen_uunifastdiscard(no_tasksets, total_util, no_tasks)
period_sets = task_gen.gen_periods_uniform(no_tasks, no_tasksets, min_period, max_period, True)
current_sets = task_gen.gen_tasksets(utils_sets, period_sets, True)
# sys.exit(1)
first_schedl = 0
second_schedl = 0
third_schedl = 0
setfile_string = "dataset_" + str(total_util) + "_" + str(no_tasks)
if not os.path.isfile(setfile_string):
with open(setfile_string, "wb") as setfile:
pickle.dump(current_sets, setfile)
else:
with open(setfile_string, "rb") as setfile:
current_sets = pickle.load(setfile)
done_tasksets = 0
for single_set in current_sets:
num_iterations = 0
budgets = [x[0] for x in single_set]
periods = [x[1] for x in single_set]
# budgets = [random.randint(5, 250) for x in single_set]
# print (budgets)
# single_set = [(budgets[i], periods[i]) for i in range(len(single_set))]
# print ("max/min budget:", max(budgets)/min(budgets))
# we calculate end_to_end delay_ub as a factor of the summation of budgets
e2e_delay_ub = int(sum(budgets) * e2e_delay_factor)
print ("Sum Budgets: {}, E2E_UB: {}".format(sum(budgets), e2e_delay_ub))
alpha_cal = float(sum(budgets)) / (float(e2e_delay_ub) * ((pow(2, 1.0 / no_tasks) - 1 - 0.01)))
equal_period = int(e2e_delay_ub / (no_tasks + 1))
# for b in budgets:
# if b > equal_period:
# print ("Not schedulable: ", single_set, equal_period)
# sys.exit(0)
#Step 1
taskset = [(b, equal_period) for b in budgets]
if utilization_bound_test(taskset) and end_to_end_delay_durr(taskset) <= e2e_delay_ub:
print ("First: ", taskset, end_to_end_delay_durr(taskset), get_total_util(taskset))
first_schedl += 1
#Step 2
else:
start = timer()
opt_alpha = optimize_alpha(single_set, budgets, equal_period, e2e_delay_ub, starting_alpha = alpha_cal, ending_alpha = 2)
end = timer()
if opt_alpha > 1:
accepted_time_taken.append((end - start))
accepted_num_iterations.append(num_iterations)
print ("Alpha cal: :", alpha_cal)
else:
rejected_time_taken.append((end - start))
if opt_alpha == 2:
second_schedl += 1
elif opt_alpha == 3:
third_schedl += 1
done_tasksets += 1
print ("{} Completed Tasksets.".format(done_tasksets))
print ("first schedulable: {}/{}".format(first_schedl, done_tasksets))
print ("second schedulable: {}/{}".format(second_schedl, done_tasksets))
print ("third schedulable: {}/{}".format(third_schedl, done_tasksets))
print ("Unschedulable: {}/{}".format((done_tasksets - first_schedl - second_schedl - third_schedl), done_tasksets))
# if done_tasksets >= 200:
# break
print ("first schedulable: {}/{}".format(first_schedl, no_tasksets))
print ("second schedulable: {}/{}".format(second_schedl, no_tasksets))
print ("third schedulable: {}/{}".format(third_schedl, no_tasksets))
print ("Unschedulable: {}/{}".format((no_tasksets - first_schedl - second_schedl - third_schedl), no_tasksets))
print ("Average Num Iteration for Accepted: ", float(sum(accepted_num_iterations)) / (first_schedl + second_schedl + third_schedl))
print ("Average Accepted Time Taken: ", float(sum(accepted_time_taken)) / (first_schedl + second_schedl + third_schedl))
print ("Average Rejected Time Taken: ", float(sum(rejected_time_taken)) / (no_tasksets - (first_schedl + second_schedl + third_schedl)))
print ("E2E Factor:", e2e_delay_factor, "Stretch Factor:", stretch_factor, "no tasks:", no_tasks)
if __name__ == "__main__":
main()