File size: 9,120 Bytes
3d4d40d |
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 |
pattern_size = 6
from collections import Counter
from dataclasses import dataclass
@dataclass(eq=True, frozen=True)
class ScheduledNode:
type: str
chunk: int
stage: int
minibatch: int
start_time: int
completion_time: int
def transform_schedule(schedule, f, b, w, c):
result = []
stage_order = []
local_prev = {}
stages = len(schedule)
for sid, stage in enumerate(schedule):
counter = Counter()
order = []
for p in stage:
if not p.strip():
continue
mb = counter.get(p, 0)
if order:
local_prev[(sid, p, mb)] = order[-1]
order.append((p, mb))
counter.update(p)
stage_order.append(order)
nmb = max(counter.values())
time_map = {}
cost = {
'F': f,
'B': b + w,
'f': f,
'b': b + w,
}
def get_time(stage, type, mb):
if (stage, type, mb) in time_map:
return time_map.get((stage, type, mb))
time = 0
if (stage, type, mb) in local_prev:
time = get_time(stage, *local_prev[(stage, type, mb)])
if type in ('F', 'B') and stage > 0:
time = max(time, get_time(stage - 1, type, mb) + c)
if type in ('f', 'b') and stage + 1< len(schedule):
time = max(time, get_time(stage + 1, type, mb) + c)
time_map[(stage, type, mb)] = time + cost[type]
return time_map[(stage, type, mb)]
r = 0
for sid, stage in enumerate(schedule):
r = max(get_time(sid, 'b', nmb - 1) - get_time(sid, 'F', 0) + f, r)
for sid, stage in enumerate(stage_order):
result_stage = []
for p, mb in stage:
result_stage.append(ScheduledNode(
p.upper(),
p in ('f', 'B', 'W'),
sid,
mb,
get_time(sid, p, mb) - cost[p],
get_time(sid, p, mb)
)
)
result.append(result_stage)
return result
def get_pattern_str(pos):
pattern = [" "] * pattern_size
notations = "FfBbWw"
for i, v in enumerate(pos):
if v < 0:
continue
pattern[v] = notations[i]
_str = ""
for v in pattern:
_str += v
return _str
def init_repeated_schedule(p, m, patterns):
repeated = []
_len = 4 * p + m + 1
for i in range(p):
str_i = get_pattern_str(patterns[i]) * _len
repeated_i = []
for v in str_i:
repeated_i.append(v)
repeated.append(repeated_i)
return repeated
def clear_invalid(repeated, stage, pos, offset=-1):
while 0 <= pos < len(repeated[stage]):
repeated[stage][pos] = ' '
pos += offset * pattern_size
return repeated
def clear_invalid_index(repeated, m):
p = len(repeated)
index = pattern_size
for identifier in ['F', 'f', 'B', 'b']:
if identifier in ['F', 'B']:
_iter = range(p)
else:
_iter = range(p - 1, -1, -1)
for i in _iter:
for j in range(pattern_size):
if repeated[i][index] == identifier:
clear_invalid(repeated, i, index - pattern_size, offset=-1)
clear_invalid(repeated, i, index + pattern_size * m, offset=1)
index += 1
if identifier in ['B', 'b']:
w_identifier = {'B': 'W', 'b': 'w'}[identifier]
for k in range(pattern_size):
if repeated[i][index + k] == w_identifier:
clear_invalid(repeated, i, index + k - pattern_size, offset=-1)
clear_invalid(repeated, i, index + k + pattern_size * m, offset=1)
break
break
index += 1
return repeated
def process_warmup_without_increasing_peak_mem(schedules, m):
peak_mem = 0
mem = [[0 for _ in range(len(schedules[0]))] for _ in range(len(schedules))]
loc = [[{key: -1 for key in ('F', 'f', 'B', 'b', 'W', 'w')} for _ in range(m + 2)] for _ in range(len(schedules))]
cntr = [{key: 0 for key in ('F', 'f', 'B', 'b', 'W', 'w')} for _ in range(len(schedules))]
for sid in range(len(schedules)):
cur = 0
for i in range(len(schedules[sid])):
if schedules[sid][i] in ('F', 'f'):
cur += 1
if schedules[sid][i] in ('W', 'w'):
cur -= 1
mem[sid][i] = cur
peak_mem = max(peak_mem, cur)
for i in range(len(schedules[0])):
for sid in range(len(schedules)):
if schedules[sid][i] == ' ':
continue
cntr[sid][schedules[sid][i]] += 1
cnt = cntr[sid][schedules[sid][i]]
pos = -1
if cnt > 1:
pos = loc[sid][cnt - 1][schedules[sid][i]]
if schedules[sid][i] == 'W':
pos = max(pos, loc[sid][cnt]['B'])
if schedules[sid][i] == 'w':
pos = max(pos, loc[sid][cnt]['b'])
if schedules[sid][i] == 'F' and sid > 0:
pos = max(pos, loc[sid - 1][cnt]['F'])
if schedules[sid][i] == 'f':
if sid != len(schedules) - 1:
pos = max(pos, loc[sid + 1][cnt]['f'])
else :
pos = max(pos, loc[sid][cnt]['F'])
if schedules[sid][i] == 'B':
if sid != 0:
#Because B and W are always combined
pos = max(pos, loc[sid - 1][cnt]['W'])
else :
pos = max(pos, loc[sid][cnt]['f'])
if schedules[sid][i] == 'b':
if sid != len(schedules) - 1:
#Because B and W are always combined
pos = max(pos, loc[sid + 1][cnt]['w'])
else :
pos = max(pos, loc[sid][cnt]['W'])
pos += 1
while schedules[sid][pos] != ' ' and pos < i:
pos += 1
if schedules[sid][i] in ('B', 'b'):
while pos < i and (schedules[sid][pos] != ' ' or schedules[sid][pos + 1] != ' '):
pos += 1
if pos == i:
loc[sid][cnt][schedules[sid][i]] = i
continue
if schedules[sid][i] in ('B', 'b', 'W', 'w'):
schedules[sid][pos] = schedules[sid][i]
schedules[sid][i] = ' '
if schedules[sid][pos] in ('W', 'w'):
for j in range(pos, i):
mem[sid][j] -= 1
loc[sid][cnt][schedules[sid][pos]] = pos
continue
#If F or f:
place = i
while place > pos and mem[sid][place - 1] < peak_mem:
place -= 1
while place < i and schedules[sid][place] != ' ':
place += 1
if place == i:
loc[sid][cnt][schedules[sid][i]] = i
continue
pos = place
schedules[sid][pos] = schedules[sid][i]
schedules[sid][i] = ' '
for j in range(pos, i):
mem[sid][j] += 1
loc[sid][cnt][schedules[sid][pos]] = pos
return schedules
def schedule_by_pattern(p, m, patterns):
schedules = init_repeated_schedule(p, m, patterns)
schedules = clear_invalid_index(schedules, m)
schedules = process_warmup_without_increasing_peak_mem(schedules, m)
for sid in range(len(schedules)):
cnt = {_id: 0 for _id in "FfBbWw"}
for i in range(len(schedules[sid])):
if(schedules[sid][i] == ' '):
continue
if cnt[schedules[sid][i]] >= m:
schedules[sid][i] = ' '
else:
cnt[schedules[sid][i]] += 1
return schedules
def create_whole_pattern(p):
whole_pattern = [[0 for _ in range(6)] for _ in range(p)]
now = 0
for i in range(p):
now += 1
whole_pattern[i][0] = now
for i in range(p):
now += 1
whole_pattern[p - 1 - i][1] = now
now += 1
if p % 3 == 0:
now += 3
cyc = (3 - (p + 2) % 3) % 3
for i in range(p):
whole_pattern[i][2], whole_pattern[i][4] = now, now + 1
cyc += 1
now += 2
if(cyc == 3):
cyc = 0
now += 3
for i in range(p):
whole_pattern[p - 1 - i][3], whole_pattern[p - 1 - i][5] = now, now + 1
cyc += 1
now += 2
if(cyc == 3):
cyc = 0
now += 3
for sid in range(p):
for i in range(6):
whole_pattern[sid][i] %= 6
return whole_pattern
def schedule(p, m, cost):
whole_pattern = create_whole_pattern(p)
s = schedule_by_pattern(p, m, whole_pattern)
for sid in range(len(s)):
for i in range(len(s[sid])):
if s[sid][i] in ('W', 'w'):
s[sid][i] = ' '
res = transform_schedule(s, *cost)
return res |