forked from mfatihaktas/deep-scheduler
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathscheduler.py
More file actions
241 lines (210 loc) · 9.7 KB
/
scheduler.py
File metadata and controls
241 lines (210 loc) · 9.7 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
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
import numpy as np
import concurrent.futures
from operator import itemgetter
from sim_exp import arrival_rate_upperbound
from mapper import *
from policygrad_learning import *
from q_learning import *
# ############################################ Scher ########################################### #
class Scher(object):
def __init__(self, mapping_m, sching_m):
self.sching_m = sching_m
self.mapper = Mapper(mapping_m)
self._type = 'Scher'
self._id = 'Scher_a={}'.format(sching_m['a'] )
self.s_len = 1
if sching_m['type'] == 'plain':
self.schedule = self.plain
elif sching_m['type'] == 'expand_if_totaldemand_leq':
self.schedule = self.expand_if_totaldemand_leq
elif sching_m['type'] == 'opportunistic':
self.schedule = self.opportunistic
def __repr__(self):
return 'Scher[sching_m={}, mapper= {}]'.format(self.sching_m, self.mapper)
def plain(self, j, w_l, cluster, expand=True):
w_l = self.mapper.worker_l(j, w_l)
if len(w_l) < j.k:
return None, -1, None
a = self.sching_m['a'] if expand else 0
# j.n = min(int(j.k + a), len(w_l) )
j.n = int(j.k + a)
if len(w_l) < j.n:
return None, -1, None
return None, a, w_l[:j.n]
def expand_if_totaldemand_leq(self, j, w_l, cluster):
try:
D = j.totaldemand
except AttributeError: # use_lessreal_sim = True
D = j.k*j.reqed*j.lifetime
expand = True if D < self.sching_m['threshold'] else False
return self.plain(j, w_l, cluster, expand)
def opportunistic(self, j, w_l, cluster):
if self.sching_m['mapping_type'] == 'packing':
w_l_ = []
for w in w_l:
sched_reqed = sum([t.reqed for t in w.t_l if t.type_ == 's'] )
if j.reqed <= w.cap - sched_reqed:
w_l_.append(w)
elif self.sching_m['mapping_type'] == 'spreading':
w_load_l = []
for w in w_l:
sched_reqed = sum([t.reqed for t in w.t_l if t.type_ == 's'] )
if j.reqed <= w.cap - sched_reqed:
w_load_l.append((w, sched_reqed/w.cap) )
w_l_ = [w for w, _ in sorted(w_load_l, key=itemgetter(1) ) ]
if len(w_l_) < j.k:
return None, -1, None
return None, 1, w_l_[:int(j.k + self.sching_m['a'] ) ]
# ################################# Scher_wMultiplicativeExpansion ############################# #
class Scher_wMultiplicativeExpansion(object):
def __init__(self, mapping_m, sching_m):
self.sching_m = sching_m
self.mapper = Mapper(mapping_m)
self._type = 'Scher_wMultiplicativeExpansion'
if sching_m['type'] == 'plain':
self.schedule = self.plain
elif sching_m['type'] == 'expand_if_totaldemand_leq':
self.schedule = self.expand_if_totaldemand_leq
self._id = 'd={}'.format(self.sching_m['threshold'] )
def __repr__(self):
return 'Scher_wMultiplicativeExpansion[sching_m={}, mapper= {}, _id= {}]'.format(self.sching_m, self.mapper, self._id)
def plain(self, j, w_l, cluster, expand=True):
r = self.sching_m['r'] if expand else 1
j.n = int(j.k*r)
w_l = self.mapper.worker_l(j, w_l)
if len(w_l) < j.n:
return None, -1, None
return None, r, w_l[:j.n]
def expand_if_totaldemand_leq(self, j, w_l, cluster):
expand = True if j.k*j.reqed*j.lifetime < self.sching_m['threshold'] else False
return self.plain(j, w_l, cluster, expand)
# ########################################### RLScher ########################################## #
NN_len = 20 # 10
class RLScher():
def __init__(self, sinfo_m, mapping_m, sching_m, save_dir='save', save_suffix=None):
self.sinfo_m = sinfo_m
self._type = 'RLScher'
self._id = 'RLScher_{}'.format(save_suffix)
self.mapper = Mapper(mapping_m)
self.s_len = STATE_LEN
self.a_len = sching_m['a'] + 1
self.N, self.T = sching_m['N'], sinfo_m['njob']
if sching_m['learner'] == 'PolicyGradLearner':
self.learner = PolicyGradLearner(self.s_len, self.a_len, nn_len=NN_len, w_actorcritic=True, save_dir=save_dir, save_suffix=save_suffix)
elif sching_m['learner'] == 'QLearner':
self.learner = QLearner(self.s_len, self.a_len, nn_len=NN_len, save_dir=save_dir, save_suffix=save_suffix)
elif sching_m['learner'] == 'QLearner_wTargetNet':
self.learner = QLearner_wTargetNet(self.s_len, self.a_len, nn_len=NN_len, save_dir=save_dir, save_suffix=save_suffix)
elif sching_m['learner'] == 'QLearner_wTargetNet_wExpReplay':
self.learner = QLearner_wTargetNet_wExpReplay(self.s_len, self.a_len, exp_buffer_size=sching_m['exp_buffer_size'], exp_batch_size=sching_m['exp_batch_size'], nn_len=NN_len, save_dir=save_dir, save_suffix=save_suffix)
def __repr__(self):
return 'RLScher[learner= {}]'.format(self.learner)
def save(self, step):
return self.learner.save(step)
def restore(self, step, save_suffix=None):
return self.learner.restore(step, save_suffix)
def summarize(self):
print("////////////////////////////////////////////////////")
if 'totaldemand_rv' in self.sinfo_m:
D = self.sinfo_m['totaldemand_rv']
l, u = D.l_l, D.u_l
i = u/10
elif 'reqed_rv' in self.sinfo_m:
R = self.sinfo_m['reqed_rv']
L = self.sinfo_m['lifetime_rv']
l = R.l_l*L.l_l
u = 500*l
i = u/10
logl, logi, logu = math.log10(l), math.log10(i), math.log10(u)
D_l = list(np.logspace(logl, logi, 5, endpoint=False) ) + list(np.logspace(logi, logu, 5) )
if STATE_LEN == 1:
for D in D_l:
# for D in np.linspace(1, 300, 10):
qa_l = self.learner.get_a_q_l(state_(D) )
print("D= {}, qa_l= {}".format(D, qa_l) )
blog(a=np.argmax(qa_l) )
elif STATE_LEN == 2:
for Eload in [0.1, 0.5, 0.9]:
for D in D_l:
qa_l = self.learner.get_a_q_l(state_(jtotaldemand=D, wload_l=[Eload]) )
print("Eload= {}, D= {}, qa_l= {}".format(Eload, D, qa_l) )
blog(a=np.argmax(qa_l) )
elif STATE_LEN == 3:
# for wait_time in [0, 100, 1000, 100000]:
for Eload in [0.1, 0.5, 0.9]:
for k in [1, 3, 7]:
for lifetime in [20, 1000, 10000]:
# qa_l = self.learner.get_a_q_l(state_(jk=k, jlifetime=lifetime, wait_time=wait_time) )
# print("wait_time= {}, k= {}, lifetime= {}; qa_l= {}".format(wait_time, k, lifetime, qa_l) )
qa_l = self.learner.get_a_q_l(state_(jk=k, jlifetime=lifetime, wload_l=[Eload] ) )
print("Eload= {}, k= {}, lifetime= {}; qa_l= {}".format(Eload, k, lifetime, qa_l) )
blog(a=np.argmax(qa_l) )
# elif 3 <= STATE_LEN <= 6:
# for wload_l in [[0.5, 0.5, 0.5, 0.5, 0.5, 0.5], [0.9, 0.9, 0.9, 0.9, 0.9, 0.9] ]:
# print(">>> wload_l= {}".format(wload_l) )
# for cluster_qlen in [0, 1, 2, 10]:
# print(">> cluster_qlen= {}".format(cluster_qlen) )
# for D in D_l:
# qa_l = self.learner.get_a_q_l(state_(D, wload_l, cluster_qlen) )
# print("D= {}, qa_l= {}".format(D, qa_l) )
# blog(a=np.argmax(qa_l) )
print("----------------------------------------------------")
def schedule(self, j, w_l, cluster):
w_l = self.mapper.worker_l(j, w_l)
if len(w_l) < j.k:
return None, -1, None
# s = state(j, [w.sched_load() for w in w_l], cluster)
s = state(j, [w.sched_load() for w in cluster.w_l], cluster)
# log(INFO, "s= {}".format(s) )
a = self.learner.get_random_action(s)
j.n = int(j.k + a)
if len(w_l) < j.n:
return None, -1, None
return s, a, w_l[:j.n]
def train(self, nsteps):
for i in range(nsteps):
alog(">> i= {}".format(i) )
n_t_s_l, n_t_a_l, n_t_r_l = np.zeros((self.N, self.T, self.s_len)), np.zeros((self.N, self.T, 1)), np.zeros((self.N, self.T, 1))
for n in range(self.N):
t_s_l, t_a_l, t_r_l, t_sl_l = sample_traj(self.sinfo_m, self)
alog("n= {}, avg_a= {}, avg_r= {}, avg_sl= {}".format(n, np.mean(t_a_l), np.mean(t_r_l), np.mean(t_sl_l) ) )
n_t_s_l[n], n_t_a_l[n], n_t_r_l[n] = t_s_l, t_a_l, t_r_l
self.learner.train_w_mult_trajs(n_t_s_l, n_t_a_l, n_t_r_l)
def train_multithreaded(self, nsteps):
if self.learner.restore(nsteps):
log(WARNING, "learner.restore is a success, will not retrain.")
else:
tp = concurrent.futures.ThreadPoolExecutor(max_workers=100)
for i in range(1, nsteps+1):
alog(">> i= {}".format(i) )
n_t_s_l, n_t_a_l, n_t_r_l = np.zeros((self.N, self.T, self.s_len)), np.zeros((self.N, self.T, 1)), np.zeros((self.N, self.T, 1))
future_n_m = {tp.submit(sample_traj, self.sinfo_m, self): n for n in range(self.N) }
for future in concurrent.futures.as_completed(future_n_m):
n = future_n_m[future]
try:
t_s_l, t_a_l, t_r_l, t_sl_l = future.result()
except Exception as exc:
log(ERROR, "exception;", exc=exc)
alog("n= {}, avg_a= {}, avg_r= {}, avg_sl= {}".format(n, np.mean(t_a_l), np.mean(t_r_l), np.mean(t_sl_l) ) )
n_t_s_l[n], n_t_a_l[n], n_t_r_l[n] = t_s_l, t_a_l, t_r_l
self.learner.train_w_mult_trajs(n_t_s_l, n_t_a_l, n_t_r_l)
# self.learner.save(i)
if __name__ == '__main__':
sinfo_m = {
'njob': 2000, 'nworker': 10, 'wcap': 10, # 10000
'totaldemand_rv': TPareto(100, 10000, 1.1),
'demandperslot_mean_rv': TPareto(0.1, 5, 1.1),
'k_rv': DUniform(1, 1),
'straggle_m': {
'slowdown': lambda load: np.random.uniform(0.01, 0.1),
'straggle_dur_rv': TPareto(10, 100, 1),
'normal_dur_rv': TPareto(10, 100, 1) } }
ar_ub = arrival_rate_upperbound(sinfo_m)
sinfo_m['ar'] = 2/4*ar_ub
sching_m = {'a': 1, 'N': 10}
blog(sinfo_m=sinfo_m, sching_m=sching_m)
scher = RLScher(sinfo_m, sching_m)
# sinfo_m['max_exprate'] = max_exprate
print("scher= {}".format(scher) )
scher.train_multithreaded(40) # train(40)
evaluate(sinfo_m, scher)