class HPCEnvSkip(gym.Env):
def __init__(self, shuffle=False, backfil=False, skip=False, job_score_type=0, batch_job_slice=0,
build_sjf=False, sched_algo=4): # do nothing and return. A workaround for passing parameters to the environment
super(HPCEnvSkip, self).__init__()
print("Initialize Simple HPC Env")
self.action_space = spaces.Discrete(2)
self.observation_space = spaces.Box(low=0.0, high=1.0,
shape=(JOB_FEATURES * MAX_QUEUE_SIZE,),
dtype=np.float32)
self.job_queue = []
self.running_jobs = []
self.visible_jobs = []
self.pairs = []
self.current_timestamp = 0
self.start = 0
self.next_arriving_job_idx = 0
self.last_job_in_batch = 0
self.num_job_in_batch = 0
self.start_idx_last_reset = 0
self.loads = None
self.cluster = None
self.bsld_algo_dict = {}
self.scheduled_rl = {}
self.penalty = 0
self.pivot_job = False
self.scheduled_scores = []
self.enable_preworkloads = False
self.pre_workloads = []
self.shuffle = shuffle
self.backfil = backfil
self.skip = skip
# 0: Average bounded slowdown, 1: Average waiting time
# 2: Average turnaround time, 3: Resource utilization
self.job_score_type = job_score_type
self.batch_job_slice = batch_job_slice
self.build_sjf = build_sjf
self.sjf_scores = []
self.schedule_algos = [self.fcfs_score, self.lcfs_score, self.smallest_score, self.largest_score, self.sjf_score, self.lpf_score, self.saf_score,
self.laf_score, self.sexp_score, self.lexp_score, self.srf_score, self.lrf_score, self.multifactor_score, self.f1_score, self.wfp_score, self.uni_score]
assert 0<= sched_algo < len(self.schedule_algos)
self.schedule_algo = self.schedule_algos[sched_algo]
#self.schedule_algo = self.smallest_score
#self.schedule_algo = self.sjf_score
# @profile
def my_init(self, workload_file='', sched_file=''):
print("loading workloads from dataset:", workload_file)
self.loads = Workloads(workload_file)
self.cluster = Cluster("Cluster", self.loads.max_nodes, self.loads.max_procs / self.loads.max_nodes)
self.penalty_job_score = JOB_SEQUENCE_SIZE * self.loads.max_exec_time / 10
if self.build_sjf: # this is for trajectory filtering.
# calculate SJF scores for all sample sequence and save them here
index = 0
if self.batch_job_slice == 0:
max_index = self.loads.size() - JOB_SEQUENCE_SIZE - 1
else:
max_index = min(self.batch_job_slice, self.loads.size()) - JOB_SEQUENCE_SIZE - 1
print("max index... initializing SJF Score Array", max_index)
while index <= max_index:
index += 1
if index % 100 == 0:
print("index", index)
self.cluster.reset()
self.loads.reset()
self.job_queue = []
self.running_jobs = []
self.visible_jobs = []
self.pairs = []
self.current_timestamp = 0
self.start = 0
self.next_arriving_job_idx = 0
self.last_job_in_batch = 0
self.num_job_in_batch = 0
self.scheduled_rl = {}
self.penalty = 0
self.pivot_job = False
self.scheduled_scores = []
job_sequence_size = JOB_SEQUENCE_SIZE
self.pre_workloads = []
self.start = index;
self.start_idx_last_reset = self.start
self.num_job_in_batch = job_sequence_size
self.last_job_in_batch = self.start + self.num_job_in_batch
self.current_timestamp = self.loads[self.start].submit_time
self.job_queue.append(self.loads[self.start])
self.next_arriving_job_idx = self.start + 1
if self.enable_preworkloads:
self.gen_preworkloads(job_sequence_size + self.np_random.randint(job_sequence_size))
self.sjf_scores.append(sum(self.schedule_curr_sequence_reset(self.sjf_score).values()))
# print(self.sjf_scores)
def seed(self, seed=None):
self.np_random, seed = seeding.np_random(seed)
return [seed]
def f1_score(self, job):
submit_time = job.submit_time
request_processors = job.request_number_of_processors
request_time = job.request_time
# run_time = job.run_time
return (np.log10(request_time if request_time > 0 else 0.1) * request_processors + 870 * np.log10(
submit_time if submit_time > 0 else 0.1))
def f2_score(self, job):
submit_time = job.submit_time
request_processors = job.request_number_of_processors
request_time = job.request_time
# run_time = job.run_time
# f2: r^(1/2)*n + 25600 * log10(s)
return (np.sqrt(request_time) * request_processors + 25600 * np.log10(submit_time))
def f3_score(self, job):
submit_time = job.submit_time
request_processors = job.request_number_of_processors
request_time = job.request_time
# run_time = job.run_time
# f3: r * n + 6860000 * log10(s)
return (request_time * request_processors + 6860000 * np.log10(submit_time))
def f4_score(self, job):
submit_time = job.submit_time
request_processors = job.request_number_of_processors
request_time = job.request_time
# run_time = job.run_time
# f4: r * sqrt(n) + 530000 * log10(s)
return (request_time * np.sqrt(request_processors) + 530000 * np.log10(submit_time))
def sjf_score(self, job):
# run_time = job.run_time
request_time = job.request_time
request_processors = job.request_number_of_processors
submit_time = job.submit_time
# if request_time is the same, pick whichever submitted earlier
return (request_time, request_processors)
def smallest_score(self, job):
request_processors = job.request_number_of_processors
submit_time = job.submit_time
# if request_time is the same, pick whichever submitted earlier
return (request_processors, submit_time)
def largest_score(self, job):
return -job.request_number_of_processors
def wfp_score(self, job):
submit_time = job.submit_time
request_processors = job.request_number_of_processors
request_time = job.request_time
waiting_time = job.scheduled_time - job.submit_time
return -np.power(float(waiting_time) / request_time, 3) * request_processors
def uni_score(self, job):
submit_time = job.submit_time
request_processors = job.request_number_of_processors
request_time = job.request_time
waiting_time = job.scheduled_time - job.submit_time
return -(waiting_time + 1e-15) / (np.log2(request_processors + 1e-15) * request_time)
def fcfs_score(self, job):
submit_time = job.submit_time
return submit_time
def lcfs_score(self, job):
return -job.submit_time
def lpf_score(self, job):
return -job.request_time
def saf_score(self, job):
return job.request_time * job.request_number_of_processors
def laf_score(self, job):
return -self.saf_score(job)
def sexp_score(self, job):
waiting_time = job.scheduled_time - job.submit_time
request_time = job.request_time
request_processors = job.request_number_of_processors
return (waiting_time + request_time)/request_processors
def lexp_score(self, job):
return -self.sexp_score(job)
def srf_score(self, job):
return job.request_time / job.request_number_of_processors
def lrf_score(self, job):
return -self.srf_score(job)
def multifactor_score(self, job, PriorityWeightAge=1000, PriorityWeightJobSize=1000):
"""
===========================
Age Factor
Association Factor
Job Size Factor
Nice Factor
Partition Factor
Quality of Service (QOS) Factor
Site Factor
TRES Factors
Fair-share Factor
===========================
Job_priority =
site_factor +
(PriorityWeightAge) * (age_factor) +
(PriorityWeightAssoc) * (assoc_factor) +
(PriorityWeightFairshare) * (fair-share_factor) +
(PriorityWeightJobSize) * (job_size_factor) +
(PriorityWeightPartition) * (partition_factor) +
(PriorityWeightQOS) * (QOS_factor) +
SUM(TRES_weight_cpu * TRES_factor_cpu,
TRES_weight_<type> * TRES_factor_<type>,
...)
- nice_factor
"""
part1 = PriorityWeightAge * (job.wait_time/(MAX_WAIT_TIME))
part2 = PriorityWeightJobSize * (1 - job.request_number_of_processors/self.loads.max_procs)
job_priority = part1 + part2
# Larger job_priority will be scheduled sooner, but smaller score means sooner, so set -job_priority as score.
return -job_priority
def gen_preworkloads(self, size):
# Generate some running jobs to randomly fill the cluster.
# size = self.np_random.randint(2 * job_sequence_size)
running_job_size = size
for i in range(running_job_size):
_job = self.loads[self.start - i - 1]
req_num_of_processors = _job.request_number_of_processors
runtime_of_job = _job.request_time
job_tmp = Job()
job_tmp.job_id = (-1 - i) # to be different from the normal jobs; normal jobs have a job_id >= 0
job_tmp.request_number_of_processors = req_num_of_processors
job_tmp.run_time = runtime_of_job
if self.cluster.can_allocated(job_tmp):
self.running_jobs.append(job_tmp)
job_tmp.scheduled_time = max(0, (self.current_timestamp - random.randint(0, max(runtime_of_job, 1))))
# job_tmp.scheduled_time = max(0, (self.current_timestamp - runtime_of_job/2))
job_tmp.allocated_machines = self.cluster.allocate(job_tmp.job_id, job_tmp.request_number_of_processors)
self.pre_workloads.append(job_tmp)
else:
break
def refill_preworkloads(self):
for _job in self.pre_workloads:
self.running_jobs.append(_job)
_job.allocated_machines = self.cluster.allocate(_job.job_id, _job.request_number_of_processors)
# @profile
def reset(self):
self.cluster.reset()
self.loads.reset()
self.job_queue = []
self.running_jobs = []
self.visible_jobs = []
self.pairs = []
self.current_timestamp = 0
self.start = 0
self.next_arriving_job_idx = 0
self.last_job_in_batch = 0
self.num_job_in_batch = 0
self.scheduled_rl = {}
self.penalty = 0
self.pivot_job = False
self.scheduled_scores = []
job_sequence_size = JOB_SEQUENCE_SIZE
self.pre_workloads = []
assert self.batch_job_slice == 0 or self.batch_job_slice >= job_sequence_size
if self.build_sjf:
done = False
while not done:
# randomly sample a sequence of jobs from workload (self.start_idx_last_reset + 1) % (self.loads.size() - 2 * job_sequence_size
if self.batch_job_slice == 0:
self.start = self.np_random.randint(job_sequence_size, (self.loads.size() - job_sequence_size - 1))
else:
self.start = self.np_random.randint(job_sequence_size,
(self.batch_job_slice - job_sequence_size - 1))
if self.sjf_scores[self.start] > 10 and self.sjf_scores[self.start] < 150:
done = True
else:
if self.batch_job_slice == 0:
self.start = self.np_random.randint(job_sequence_size, (self.loads.size() - job_sequence_size - 1))
else:
self.start = self.np_random.randint(job_sequence_size, (self.batch_job_slice - job_sequence_size - 1))
self.start_idx_last_reset = self.start
self.num_job_in_batch = job_sequence_size
self.last_job_in_batch = self.start + self.num_job_in_batch
self.current_timestamp = self.loads[self.start].submit_time
self.job_queue.append(self.loads[self.start])
self.next_arriving_job_idx = self.start + 1
if self.enable_preworkloads:
self.gen_preworkloads(job_sequence_size + self.np_random.randint(job_sequence_size))
self.scheduled_scores.append(sum(self.schedule_curr_sequence_reset(self.schedule_algo).values()))
# self.scheduled_scores.append(sum(self.schedule_curr_sequence_reset(self.sjf_score).values()))
# self.scheduled_scores.append(sum(self.schedule_curr_sequence_reset(self.f1_score).values()))
# self.scheduled_scores.append(sum(self.schedule_curr_sequence_reset(self.smallest_score).values()))
# self.scheduled_scores.append(sum(self.schedule_curr_sequence_reset(self.fcfs_score).values()))
# self.scheduled_scores.append(sum(self.schedule_curr_sequence_reset(self.f2_score).values()))
# self.scheduled_scores.append(sum(self.schedule_curr_sequence_reset(self.f3_score).values()))
# self.scheduled_scores.append(sum(self.schedule_curr_sequence_reset(self.f4_score).values()))
return self.build_observation(), self.build_critic_observation()
# print(np.mean(self.scheduled_scores))
'''
if (np.mean(self.scheduled_scores) > 5):
return self.build_observation()
else:
return self.reset()
'''
def reset_for_test(self, num, start):
self.cluster.reset()
self.loads.reset()
self.job_queue = []
self.running_jobs = []
self.visible_jobs = []
self.pairs = []
self.current_timestamp = 0
self.start = 0
self.next_arriving_job_idx = 0
self.last_job_in_batch = 0
self.num_job_in_batch = 0
self.scheduled_rl = {}
self.penalty = 0
self.pivot_job = False
self.scheduled_scores = []
job_sequence_size = num
assert self.batch_job_slice == 0 or self.batch_job_slice >= job_sequence_size
#if self.batch_job_slice == 0:
# self.start = self.np_random.randint(job_sequence_size, (self.loads.size() - job_sequence_size - 1))
#else:
# self.start = self.np_random.randint(job_sequence_size, (self.batch_job_slice - job_sequence_size - 1))
self.start = start
self.start_idx_last_reset = self.start
self.num_job_in_batch = job_sequence_size
self.last_job_in_batch = self.start + self.num_job_in_batch
self.current_timestamp = self.loads[self.start].submit_time
self.job_queue.append(self.loads[self.start])
self.next_arriving_job_idx = self.start + 1
def skip_for_resources_greedy(self, job, scheduled_logs):
# note that this function is only called when current job can not be scheduled.
assert not self.cluster.can_allocated(job)
while not self.cluster.can_allocated(job):
# schedule nothing, just move forward to next timestamp. It should just add a new job or finish a running job
assert self.running_jobs
self.running_jobs.sort(key=lambda running_job: (running_job.scheduled_time + running_job.run_time))
next_resource_release_time = (self.running_jobs[0].scheduled_time + self.running_jobs[0].run_time)
next_resource_release_machines = self.running_jobs[0].allocated_machines
if self.next_arriving_job_idx < self.last_job_in_batch and self.loads[
self.next_arriving_job_idx].submit_time <= next_resource_release_time:
self.current_timestamp = max(self.current_timestamp, self.loads[self.next_arriving_job_idx].submit_time)
self.job_queue.append(self.loads[self.next_arriving_job_idx])
self.next_arriving_job_idx += 1
else:
self.current_timestamp = max(self.current_timestamp, next_resource_release_time)
self.cluster.release(next_resource_release_machines)
self.running_jobs.pop(0) # remove the first running job.
# @profile
def moveforward_for_resources_backfill_greedy(self, job, scheduled_logs):
# note that this function is only called when current job can not be scheduled.
assert not self.cluster.can_allocated(job)
earliest_start_time = self.current_timestamp
# sort all running jobs by estimated finish time
self.running_jobs.sort(key=lambda running_job: (running_job.scheduled_time + running_job.request_time))
free_processors = self.cluster.free_node * self.cluster.num_procs_per_node
for running_job in self.running_jobs:
free_processors += len(running_job.allocated_machines) * self.cluster.num_procs_per_node
earliest_start_time = (running_job.scheduled_time + running_job.request_time)
if free_processors >= job.request_number_of_processors:
break
while not self.cluster.can_allocated(job):
# try to backfill as many jobs as possible. Use FCFS
self.job_queue.sort(key=lambda _j: self.fcfs_score(_j))
job_queue_iter_copy = list(self.job_queue)
for _j in job_queue_iter_copy:
if (self.current_timestamp + _j.request_time) < earliest_start_time:
if self.cluster.can_allocated(_j):
# we should be OK to schedule the job now
assert _j.scheduled_time == -1 # this job should never be scheduled before.
_j.scheduled_time = self.current_timestamp
_j.allocated_machines = self.cluster.allocate(_j.job_id, _j.request_number_of_processors)
self.running_jobs.append(_j)
score = self.job_score(_j) # calculated reward
scheduled_logs[_j.job_id] = score
self.job_queue.remove(_j) # remove the job from job queue
# move to the next timestamp
assert self.running_jobs
self.running_jobs.sort(key=lambda running_job: (running_job.scheduled_time + running_job.run_time))
next_resource_release_time = (self.running_jobs[0].scheduled_time + self.running_jobs[0].run_time)
next_resource_release_machines = self.running_jobs[0].allocated_machines
if self.next_arriving_job_idx < self.last_job_in_batch \
and self.loads[self.next_arriving_job_idx].submit_time <= next_resource_release_time:
self.current_timestamp = max(self.current_timestamp, self.loads[self.next_arriving_job_idx].submit_time)
self.job_queue.append(self.loads[self.next_arriving_job_idx])
self.next_arriving_job_idx += 1
else:
self.current_timestamp = max(self.current_timestamp, next_resource_release_time)
self.cluster.release(next_resource_release_machines)
self.running_jobs.pop(0) # remove the first running job
def post_process_score(self, scheduled_logs):
scheduled_logs_len = len(scheduled_logs)
if self.job_score_type == 0:
# bsld
for i in scheduled_logs:
scheduled_logs[i] /= scheduled_logs_len
elif self.job_score_type == 1:
# wait time
for i in scheduled_logs:
scheduled_logs[i] /= scheduled_logs_len
elif self.job_score_type == 2:
# turnaround time
for i in scheduled_logs:
scheduled_logs[i] /= scheduled_logs_len
elif self.job_score_type == 3:
total_cpu_hour = (self.current_timestamp - self.loads[self.start].submit_time) * self.loads.max_procs
for i in scheduled_logs:
scheduled_logs[i] /= total_cpu_hour
elif self.job_score_type == 4:
for i in scheduled_logs:
scheduled_logs[i] /= scheduled_logs_len
else:
raise NotImplementedError
# @profile
def schedule_curr_sequence_reset(self, score_fn):
# schedule the sequence of jobs using heuristic algorithm.
scheduled_logs = {}
# f = False
# if score_fn.__name__ == "sjf_score":
# f = True
# num_total = 0
# start_time = time.time()
while True:
self.job_queue.sort(key=lambda j: score_fn(j))
job_for_scheduling = self.job_queue[0]
# if f:
# num_total += 1
# if selected job needs more resources, skip scheduling and try again after adding new jobs or releasing some resources
if not self.cluster.can_allocated(job_for_scheduling):
if self.backfil:
self.moveforward_for_resources_backfill_greedy(job_for_scheduling, scheduled_logs)
else:
self.skip_for_resources_greedy(job_for_scheduling, scheduled_logs)
assert job_for_scheduling.scheduled_time == -1 # this job should never be scheduled before.
job_for_scheduling.scheduled_time = self.current_timestamp
job_for_scheduling.allocated_machines = self.cluster.allocate(job_for_scheduling.job_id,
job_for_scheduling.request_number_of_processors)
self.running_jobs.append(job_for_scheduling)
score = self.job_score(job_for_scheduling) # calculated reward
scheduled_logs[job_for_scheduling.job_id] = score
self.job_queue.remove(job_for_scheduling)
not_empty = self.moveforward_for_job()
if not not_empty:
break
self.post_process_score(scheduled_logs)
#with open("sjf_logs", 'w') as f:
# for i in sorted(self.loads[:50000]):
# f.write("{}\t{}\t{}\t{}\n".format(i.job_id, i.submit_time, i.run_time, i.scheduled_time))
# if f:
# print((time.time()-start_time)/num_total, num_total)
# reset again
self.cluster.reset()
self.loads.reset()
self.job_queue = []
self.running_jobs = []
self.visible_jobs = []
self.pairs = []
self.current_timestamp = self.loads[self.start].submit_time
self.job_queue.append(self.loads[self.start])
self.last_job_in_batch = self.start + self.num_job_in_batch
self.next_arriving_job_idx = self.start + 1
if self.enable_preworkloads:
self.refill_preworkloads()
return scheduled_logs
def build_critic_observation(self):
vector = np.zeros(JOB_SEQUENCE_SIZE * 3, dtype=float)
earlist_job = self.loads[self.start_idx_last_reset]
earlist_submit_time = earlist_job.submit_time
pairs = []
for i in range(self.start_idx_last_reset, self.last_job_in_batch + 1):
job = self.loads[i]
submit_time = job.submit_time - earlist_submit_time
request_processors = job.request_number_of_processors
request_time = job.request_time
normalized_submit_time = min(float(submit_time) / float(MAX_WAIT_TIME), 1.0 - 1e-5)
normalized_run_time = min(float(request_time) / float(self.loads.max_exec_time), 1.0 - 1e-5)
normalized_request_nodes = min(float(request_processors) / float(self.loads.max_procs), 1.0 - 1e-5)
pairs.append([normalized_submit_time, normalized_run_time, normalized_request_nodes])
for i in range(JOB_SEQUENCE_SIZE):
vector[i * 3:(i + 1) * 3] = pairs[i]
return vector
def build_observation2(self):
vector = np.zeros((MAX_QUEUE_SIZE) * JOB_FEATURES, dtype=float)
self.pairs = []
for i in range(0, MAX_QUEUE_SIZE):
if i < len(self.visible_jobs) and i < (MAX_QUEUE_SIZE ):
job = self.visible_jobs[i]
submit_time = job.submit_time
request_processors = job.request_number_of_processors
request_time = job.request_time
# run_time = job.run_time
wait_time = self.current_timestamp - submit_time
# make sure that larger value is better.
normalized_wait_time = min(float(wait_time) / float(MAX_WAIT_TIME), 1.0 - 1e-5)
normalized_run_time = min(float(request_time) / float(self.loads.max_exec_time), 1.0 - 1e-5)
normalized_request_nodes = min(float(request_processors) / float(self.loads.max_procs), 1.0 - 1e-5)
'''
@ddai: part 2 of OPTIMIZE_OBSV
earliest_start_time = 1
for fp, ts in free_processors_pair:
if request_processors < fp:
earliest_start_time = ts
break
normalized_earliest_start_time = min(float(earliest_start_time) / float(MAX_WAIT_TIME), 1.0 - 1e-5)
'''
# add extra parameters, include "Requested Memory", "User Id", "Groupd Id", "Exectuable Id", if its value does not exist in the trace (-1), we set it to 1 by default.
if job.request_memory == -1:
normalized_request_memory = 1
else:
normalized_request_memory = min(float(job.request_memory)/float(self.loads.max_requested_memory), 1.0 - 1e-5)
if job.user_id == -1:
normalized_user_id = 1
else:
normalized_user_id = min(float(job.user_id)/float(self.loads.max_user_id), 1.0-1e-5)
if job.group_id == -1:
normalized_group_id = 1
else:
normalized_group_id = min(float(job.group_id)/float(self.loads.max_group_id), 1.0-1e-5)
if job.executable_number == -1:
normalized_executable_id = 1
else:
normalized_executable_id = min(float(job.executable_number)/float(self.loads.max_executable_number), 1.0-1e-5)
if self.cluster.can_allocated(job):
can_schedule_now = 1.0 - 1e-5
else:
can_schedule_now = 1e-5
self.pairs.append([job,normalized_wait_time, normalized_run_time, normalized_request_nodes, normalized_request_memory, normalized_user_id, normalized_group_id, normalized_executable_id, can_schedule_now])
else:
self.pairs.append([None,0,1,1,1,1,1,1,0])
for i in range(0, MAX_QUEUE_SIZE):
vector[i*JOB_FEATURES:(i+1)*JOB_FEATURES] = self.pairs[i][1:]
return vector
def build_observation(self):
vector = np.zeros((MAX_QUEUE_SIZE) * JOB_FEATURES, dtype=float)
job = min(self.job_queue, key=self.schedule_algo)
self.pairs = []
submit_time = job.submit_time
request_processors = job.request_number_of_processors
request_time = job.request_time
# run_time = job.run_time
wait_time = self.current_timestamp - submit_time
# make sure that larger value is better.
normalized_wait_time = min(float(wait_time) / float(MAX_WAIT_TIME), 1.0 - 1e-5)
normalized_run_time = min(float(request_time) / float(self.loads.max_exec_time), 1.0 - 1e-5)
normalized_request_nodes = min(float(request_processors) / float(self.loads.max_procs), 1.0 - 1e-5)
'''
@ddai: part 2 of OPTIMIZE_OBSV
earliest_start_time = 1
for fp, ts in free_processors_pair:
if request_processors < fp:
earliest_start_time = ts
break
normalized_earliest_start_time = min(float(earliest_start_time) / float(MAX_WAIT_TIME), 1.0 - 1e-5)
'''
# add extra parameters, include "Requested Memory", "User Id", "Groupd Id", "Exectuable Id", if its value does not exist in the trace (-1), we set it to 1 by default.
normalized_free_nodes = min(float(self.cluster.free_node) / float(self.loads.max_nodes), 1.0 - 1e-5)
if self.cluster.can_allocated(job):
can_schedule_now = 1.0 - 1e-5
else:
can_schedule_now = 1e-5
normalized_skip_time = min(job.skip_time / float(MAX_SKIP_TIME), 1.0)
delta_bsld = sum((float(SKIP_TIME) / max(i.request_time, 10)) for i in self.job_queue)
normalized_delta_bsld = min(delta_bsld / float(SKIP_TIME/10 * JOB_SEQUENCE_SIZE), 1.0 - 1e-5)
#wait_queue_time = sum(float(SKIP_TIME) for i in self.job_queue)
#normalized_delta_bsld = min(wait_queue_time / float(SKIP_TIME * JOB_SEQUENCE_SIZE), 1.0 - 1e-5)
#self.pairs.append([job, normalized_wait_time, normalized_run_time,
self.pairs.append([job, normalized_wait_time, normalized_run_time,
normalized_request_nodes,normalized_free_nodes, can_schedule_now, normalized_skip_time, normalized_delta_bsld])
for i in range(0, MAX_QUEUE_SIZE):
vector[i * JOB_FEATURES:(i + 1) * JOB_FEATURES] = self.pairs[i][1:]
return vector
# @profile
def moveforward_for_resources_backfill(self, job):
# note that this function is only called when current job can not be scheduled.
assert not self.cluster.can_allocated(job)
earliest_start_time = self.current_timestamp
# sort all running jobs by estimated finish time
self.running_jobs.sort(key=lambda running_job: (running_job.scheduled_time + running_job.request_time))
free_processors = self.cluster.free_node * self.cluster.num_procs_per_node
for running_job in self.running_jobs:
free_processors += len(running_job.allocated_machines) * self.cluster.num_procs_per_node
earliest_start_time = (running_job.scheduled_time + running_job.request_time)
if free_processors >= job.request_number_of_processors:
break
while not self.cluster.can_allocated(job):
# try to backfill as many jobs as possible. Use FCFS
self.job_queue.sort(key=lambda _j: self.fcfs_score(_j))
job_queue_iter_copy = list(self.job_queue)
for _j in job_queue_iter_copy:
if self.cluster.can_allocated(_j) and (self.current_timestamp + _j.request_time) < earliest_start_time:
# we should be OK to schedule the job now
assert _j.scheduled_time == -1 # this job should never be scheduled before.
_j.scheduled_time = self.current_timestamp
_j.allocated_machines = self.cluster.allocate(_j.job_id, _j.request_number_of_processors)
self.running_jobs.append(_j)
score = self.job_score(_j) # calculated reward
self.scheduled_rl[_j.job_id] = score
self.job_queue.remove(_j) # remove the job from job queue
# move to the next timestamp
assert self.running_jobs
self.running_jobs.sort(key=lambda running_job: (running_job.scheduled_time + running_job.run_time))
next_resource_release_time = (self.running_jobs[0].scheduled_time + self.running_jobs[0].run_time)
next_resource_release_machines = self.running_jobs[0].allocated_machines
if self.next_arriving_job_idx < self.last_job_in_batch \
and self.loads[self.next_arriving_job_idx].submit_time <= next_resource_release_time:
self.current_timestamp = max(self.current_timestamp, self.loads[self.next_arriving_job_idx].submit_time)
self.job_queue.append(self.loads[self.next_arriving_job_idx])
self.next_arriving_job_idx += 1
else:
self.current_timestamp = max(self.current_timestamp, next_resource_release_time)
self.cluster.release(next_resource_release_machines)
self.running_jobs.pop(0) # remove the first running job
def skip_for_resources(self, job):
# note that this function is only called when current job can not be scheduled.
assert not self.cluster.can_allocated(job)
while not self.cluster.can_allocated(job):
# schedule nothing, just move forward to next timestamp. It should just add a new job or finish a running job
assert self.running_jobs
self.running_jobs.sort(key=lambda running_job: (running_job.scheduled_time + running_job.run_time))
next_resource_release_time = (self.running_jobs[0].scheduled_time + self.running_jobs[0].run_time)
next_resource_release_machines = self.running_jobs[0].allocated_machines
if self.next_arriving_job_idx < self.last_job_in_batch and self.loads[
self.next_arriving_job_idx].submit_time <= next_resource_release_time:
self.current_timestamp = max(self.current_timestamp, self.loads[self.next_arriving_job_idx].submit_time)
self.job_queue.append(self.loads[self.next_arriving_job_idx])
self.next_arriving_job_idx += 1
else:
self.current_timestamp = max(self.current_timestamp, next_resource_release_time)
self.cluster.release(next_resource_release_machines)
self.running_jobs.pop(0) # remove the first running job.
# @profile
def moveforward_for_job(self):
if self.job_queue:
return True
# if we need to add job, but can not add any more, return False indicating the job_queue is for sure empty now.
if self.next_arriving_job_idx >= self.last_job_in_batch:
assert not self.job_queue
return False
# move forward to add jobs into job queue.
while not self.job_queue:
if not self.running_jobs: # there are no running jobs
next_resource_release_time = sys.maxsize # always add jobs if no resource can be released.
next_resource_release_machines = []
else:
self.running_jobs.sort(key=lambda running_job: (running_job.scheduled_time + running_job.run_time))
next_resource_release_time = (self.running_jobs[0].scheduled_time + self.running_jobs[0].run_time)
next_resource_release_machines = self.running_jobs[0].allocated_machines
if self.loads[self.next_arriving_job_idx].submit_time <= next_resource_release_time:
self.current_timestamp = max(self.current_timestamp, self.loads[self.next_arriving_job_idx].submit_time)
self.job_queue.append(self.loads[self.next_arriving_job_idx])
self.next_arriving_job_idx += 1
return True # job added
else:
self.current_timestamp = max(self.current_timestamp, next_resource_release_time)
self.cluster.release(next_resource_release_machines)
self.running_jobs.pop(0) # remove the first running job.
def job_score(self, job_for_scheduling):
# 0: Average bounded slowdown, 1: Average waiting time
# 2: Average turnaround time, 3: Resource utilization 4: Average slowdown
if self.job_score_type == 0:
# bsld
_tmp = max(1.0, (float(
job_for_scheduling.scheduled_time - job_for_scheduling.submit_time + job_for_scheduling.run_time)
/
max(job_for_scheduling.run_time, 10)))
elif self.job_score_type == 1:
# wait time
_tmp = float(job_for_scheduling.scheduled_time - job_for_scheduling.submit_time)
elif self.job_score_type == 2:
# turnaround time
_tmp = float(
job_for_scheduling.scheduled_time - job_for_scheduling.submit_time + job_for_scheduling.run_time)
elif self.job_score_type == 3:
# utilization
_tmp = -float(job_for_scheduling.run_time * job_for_scheduling.request_number_of_processors)
elif self.job_score_type == 4:
# sld
_tmp = float(
job_for_scheduling.scheduled_time - job_for_scheduling.submit_time + job_for_scheduling.run_time) \
/ job_for_scheduling.run_time
else:
raise NotImplementedError
# Weight larger jobs.
# _tmp = _tmp * (job_for_scheduling.run_time * job_for_scheduling.request_number_of_processors)
return _tmp
def has_only_one_job(self):
if len(self.job_queue) == 1:
return True
else:
return False
def skip_schedule(self):
# schedule nothing, just move forward to next timestamp. It should 1) add a new job; 2) finish a running job; 3) reach skip time
next_time_after_skip = self.current_timestamp + SKIP_TIME
next_resource_release_time = sys.maxsize # always add jobs if no resource can be released.
next_resource_release_machines = []
if self.running_jobs: # there are running jobs
self.running_jobs.sort(key=lambda running_job: (running_job.scheduled_time + running_job.run_time))
next_resource_release_time = (self.running_jobs[0].scheduled_time + self.running_jobs[0].run_time)
next_resource_release_machines = self.running_jobs[0].allocated_machines
if self.next_arriving_job_idx >= self.last_job_in_batch and not self.running_jobs:
if not self.pivot_job:
self.pivot_job = True
return False, 0
else:
return False, 0
if next_time_after_skip < min(self.loads[self.next_arriving_job_idx].submit_time, next_resource_release_time):
self.current_timestamp = next_time_after_skip
return False, 0
if self.next_arriving_job_idx < self.last_job_in_batch and self.loads[
self.next_arriving_job_idx].submit_time <= next_resource_release_time:
self.current_timestamp = max(self.current_timestamp, self.loads[self.next_arriving_job_idx].submit_time)
self.job_queue.append(self.loads[self.next_arriving_job_idx])
self.next_arriving_job_idx += 1
else:
self.current_timestamp = max(self.current_timestamp, next_resource_release_time)
self.cluster.release(next_resource_release_machines)
self.running_jobs.pop(0) # remove the first running job.
return False, 0
def schedule(self, job_for_scheduling):
# make sure we move forward and release needed resources
if not self.cluster.can_allocated(job_for_scheduling):
if self.backfil:
self.moveforward_for_resources_backfill(job_for_scheduling)
else:
self.skip_for_resources(job_for_scheduling)
# we should be OK to schedule the job now
assert job_for_scheduling.scheduled_time == -1 # this job should never be scheduled before.
job_for_scheduling.scheduled_time = self.current_timestamp
job_for_scheduling.allocated_machines = self.cluster.allocate(job_for_scheduling.job_id,
job_for_scheduling.request_number_of_processors)
self.running_jobs.append(job_for_scheduling)
score = self.job_score(job_for_scheduling) # calculated reward
self.scheduled_rl[job_for_scheduling.job_id] = score
self.job_queue.remove(job_for_scheduling) # remove the job from job queue
# after scheduling, check if job queue is empty, try to add jobs.
not_empty = self.moveforward_for_job()
if not_empty:
# job_queue is not empty
return False
else:
# job_queue is empty and can not add new jobs as we reach the end of the sequence
return True
def valid(self, a):
action = a[0]
return self.pairs[action][0]
# @profile
def step(self, a):
will_skip = a
job_for_scheduling = min(self.job_queue, key=self.schedule_algo)
if will_skip==1:
job_for_scheduling.skip_time += SKIP_TIME
done, _ = self.skip_schedule()
else:
done = self.schedule(job_for_scheduling)
if not done:
obs = self.build_observation()
return [obs, 0, False, 0, 0, 0]
else:
self.post_process_score(self.scheduled_rl)
rl_total = sum(self.scheduled_rl.values())
best_total = min(self.scheduled_scores)
#sjf = self.scheduled_scores[1]
#f1 = self.scheduled_scores[2]
sched_algo_reward = self.scheduled_scores[0]
rwd2 = (sched_algo_reward - rl_total)
rwd = (sched_algo_reward - rl_total)
#print(sched_algo_reward, rl_total)
rwd = (sched_algo_reward - rl_total)/max(sched_algo_reward, rl_total,1)
#rwd = (- rl_total)
#if rwd < 0:
# rwd = -1
#elif rwd == 0:
# rwd = 0
#else:
# rwd = 1
return [None, rwd, True, rwd2, sched_algo_reward, 0]
def step_for_test(self, a):
will_skip = a
job_for_scheduling = min(self.job_queue, key=self.schedule_algo)
if will_skip==1:
# print("SKIP", end=" ")
job_for_scheduling.skip_time += SKIP_TIME
done, _ = self.skip_schedule()
else:
done = self.schedule(job_for_scheduling)
if not done:
obs = self.build_observation()
return [obs, 0, False, None]
else:
self.post_process_score(self.scheduled_rl)
rl_total = sum(self.scheduled_rl.values())
return [None, rl_total, True, None]
class HPCEnv(gym.Env):
def __init__(self,shuffle=False, backfil=False, skip=False, job_score_type=0, batch_job_slice=0, build_sjf=False): # do nothing and return. A workaround for passing parameters to the environment
super(HPCEnv, self).__init__()
print("Initialize Simple HPC Env")
self.action_space = spaces.Discrete(MAX_QUEUE_SIZE)
self.observation_space = spaces.Box(low=0.0, high=1.0,
shape=(JOB_FEATURES * MAX_QUEUE_SIZE,),
dtype=np.float32)
self.job_queue = []
self.running_jobs = []
self.visible_jobs = []
self.pairs = []
self.current_timestamp = 0
self.start = 0
self.next_arriving_job_idx = 0
self.last_job_in_batch = 0
self.num_job_in_batch = 0
self.start_idx_last_reset = 0
self.loads = None
self.cluster = None
self.bsld_algo_dict = {}
self.scheduled_rl = {}
self.penalty = 0
self.pivot_job = False
self.scheduled_scores = []
self.enable_preworkloads = False
self.pre_workloads = []
self.shuffle = shuffle
self.backfil = backfil
self.skip = skip
# 0: Average bounded slowdown, 1: Average waiting time
# 2: Average turnaround time, 3: Resource utilization
self.job_score_type = job_score_type
self.batch_job_slice = batch_job_slice
self.build_sjf = build_sjf
self.sjf_scores = []
#@profile
def my_init(self, workload_file = '', sched_file = ''):
print ("loading workloads from dataset:", workload_file)
self.loads = Workloads(workload_file)
self.cluster = Cluster("Cluster", self.loads.max_nodes, self.loads.max_procs/self.loads.max_nodes)
self.penalty_job_score = JOB_SEQUENCE_SIZE * self.loads.max_exec_time / 10
if self.build_sjf: #this is for trajectory filtering.
#calculate SJF scores for all sample sequence and save them here
index = 0
if self.batch_job_slice == 0:
max_index = self.loads.size() - JOB_SEQUENCE_SIZE - 1
else:
max_index = min(self.batch_job_slice, self.loads.size()) - JOB_SEQUENCE_SIZE - 1
print("max index... initializing SJF Score Array", max_index)
while index <= max_index:
index += 1
if index % 100 == 0:
print("index", index)
self.cluster.reset()
self.loads.reset()
self.job_queue = []
self.running_jobs = []
self.visible_jobs = []
self.pairs = []
self.current_timestamp = 0
self.start = 0
self.next_arriving_job_idx = 0
self.last_job_in_batch = 0
self.num_job_in_batch = 0
self.scheduled_rl = {}
self.penalty = 0
self.pivot_job = False
self.scheduled_scores = []
job_sequence_size = JOB_SEQUENCE_SIZE
self.pre_workloads = []
self.start = index;
self.start_idx_last_reset = self.start
self.num_job_in_batch = job_sequence_size
self.last_job_in_batch = self.start + self.num_job_in_batch
self.current_timestamp = self.loads[self.start].submit_time
self.job_queue.append(self.loads[self.start])
self.next_arriving_job_idx = self.start + 1
if self.enable_preworkloads:
self.gen_preworkloads(job_sequence_size + self.np_random.randint(job_sequence_size))
self.sjf_scores.append(sum(self.schedule_curr_sequence_reset(self.sjf_score).values()))
#print(self.sjf_scores)
def seed(self, seed=None):
self.np_random, seed = seeding.np_random(seed)
return [seed]
def f1_score(self, job):
submit_time = job.submit_time
request_processors = job.request_number_of_processors
request_time = job.request_time
# run_time = job.run_time
return (np.log10(request_time if request_time>0 else 0.1) * request_processors + 870 * np.log10(submit_time if submit_time>0 else 0.1))
def f2_score(self, job):
submit_time = job.submit_time
request_processors = job.request_number_of_processors
request_time = job.request_time
# run_time = job.run_time
# f2: r^(1/2)*n + 25600 * log10(s)
return (np.sqrt(request_time) * request_processors + 25600 * np.log10(submit_time))
def f3_score(self, job):
submit_time = job.submit_time
request_processors = job.request_number_of_processors
request_time = job.request_time
# run_time = job.run_time
# f3: r * n + 6860000 * log10(s)
return (request_time * request_processors + 6860000 * np.log10(submit_time))
def f4_score(self, job):
submit_time = job.submit_time
request_processors = job.request_number_of_processors
request_time = job.request_time
# run_time = job.run_time
# f4: r * sqrt(n) + 530000 * log10(s)
return (request_time * np.sqrt(request_processors) + 530000 * np.log10(submit_time))
def sjf_score(self, job):
# run_time = job.run_time
request_time = job.request_time
submit_time = job.submit_time
# if request_time is the same, pick whichever submitted earlier
return (request_time, submit_time)
def smallest_score(self, job):
request_processors = job.request_number_of_processors
submit_time = job.submit_time
# if request_time is the same, pick whichever submitted earlier
return (request_processors, submit_time)
def wfp_score(self, job):
submit_time = job.submit_time
request_processors = job.request_number_of_processors
request_time = job.request_time
waiting_time = job.scheduled_time-job.submit_time
return -np.power(float(waiting_time)/request_time, 3)*request_processors
def uni_score(self,job):
submit_time = job.submit_time
request_processors = job.request_number_of_processors
request_time = job.request_time
waiting_time = job.scheduled_time-job.submit_time
return -(waiting_time+1e-15)/(np.log2(request_processors+1e-15)*request_time)
def fcfs_score(self, job):
submit_time = job.submit_time
return submit_time
def gen_preworkloads(self, size):
# Generate some running jobs to randomly fill the cluster.
# size = self.np_random.randint(2 * job_sequence_size)
running_job_size = size
for i in range(running_job_size):
_job = self.loads[self.start - i - 1]
req_num_of_processors = _job.request_number_of_processors
runtime_of_job = _job.request_time
job_tmp = Job()
job_tmp.job_id = (-1 - i) # to be different from the normal jobs; normal jobs have a job_id >= 0
job_tmp.request_number_of_processors = req_num_of_processors
job_tmp.run_time = runtime_of_job
if self.cluster.can_allocated(job_tmp):
self.running_jobs.append(job_tmp)
job_tmp.scheduled_time = max(0, (self.current_timestamp - random.randint(0, max(runtime_of_job, 1))))
# job_tmp.scheduled_time = max(0, (self.current_timestamp - runtime_of_job/2))
job_tmp.allocated_machines = self.cluster.allocate(job_tmp.job_id, job_tmp.request_number_of_processors)
self.pre_workloads.append(job_tmp)
else:
break
def refill_preworkloads(self):
for _job in self.pre_workloads:
self.running_jobs.append(_job)
_job.allocated_machines = self.cluster.allocate(_job.job_id, _job.request_number_of_processors)
#@profile
def reset(self):
self.cluster.reset()
self.loads.reset()
self.job_queue = []
self.running_jobs = []
self.visible_jobs = []
self.pairs = []
self.current_timestamp = 0
self.start = 0
self.next_arriving_job_idx = 0
self.last_job_in_batch = 0
self.num_job_in_batch = 0
self.scheduled_rl = {}
self.penalty = 0
self.pivot_job = False
self.scheduled_scores = []
job_sequence_size = JOB_SEQUENCE_SIZE
self.pre_workloads = []
assert self.batch_job_slice == 0 or self.batch_job_slice>=job_sequence_size
if self.build_sjf:
done = False
while not done:
# randomly sample a sequence of jobs from workload (self.start_idx_last_reset + 1) % (self.loads.size() - 2 * job_sequence_size
if self.batch_job_slice == 0:
self.start = self.np_random.randint(job_sequence_size, (self.loads.size() - job_sequence_size - 1))
else:
self.start = self.np_random.randint(job_sequence_size, (self.batch_job_slice - job_sequence_size - 1))
if self.sjf_scores[self.start] > 10 and self.sjf_scores[self.start] < 150:
done = True
else:
if self.batch_job_slice == 0:
self.start = self.np_random.randint(job_sequence_size, (self.loads.size() - job_sequence_size - 1))
else:
self.start = self.np_random.randint(job_sequence_size, (self.batch_job_slice - job_sequence_size - 1))
self.start_idx_last_reset = self.start
self.num_job_in_batch = job_sequence_size
self.last_job_in_batch = self.start + self.num_job_in_batch
self.current_timestamp = self.loads[self.start].submit_time
self.job_queue.append(self.loads[self.start])
self.next_arriving_job_idx = self.start + 1
if self.enable_preworkloads:
self.gen_preworkloads(job_sequence_size + self.np_random.randint(job_sequence_size))
self.scheduled_scores.append(sum(self.schedule_curr_sequence_reset(self.sjf_score).values()))
self.scheduled_scores.append(sum(self.schedule_curr_sequence_reset(self.f1_score).values()))
# self.scheduled_scores.append(sum(self.schedule_curr_sequence_reset(self.smallest_score).values()))
# self.scheduled_scores.append(sum(self.schedule_curr_sequence_reset(self.fcfs_score).values()))
#self.scheduled_scores.append(sum(self.schedule_curr_sequence_reset(self.f2_score).values()))
#self.scheduled_scores.append(sum(self.schedule_curr_sequence_reset(self.f3_score).values()))
#self.scheduled_scores.append(sum(self.schedule_curr_sequence_reset(self.f4_score).values()))
return self.build_observation(), self.build_critic_observation()
#print(np.mean(self.scheduled_scores))
'''
if (np.mean(self.scheduled_scores) > 5):
return self.build_observation()
else:
return self.reset()
'''
def reset_for_test(self, num,start):
self.cluster.reset()
self.loads.reset()
self.job_queue = []
self.running_jobs = []
self.visible_jobs = []
self.pairs = []
self.current_timestamp = 0
self.start = 0
self.next_arriving_job_idx = 0
self.last_job_in_batch = 0
self.num_job_in_batch = 0
self.scheduled_rl = {}
self.penalty = 0
self.pivot_job = False
self.scheduled_scores = []
job_sequence_size = num
assert self.batch_job_slice == 0 or self.batch_job_slice>=job_sequence_size
if self.batch_job_slice == 0:
self.start = self.np_random.randint(job_sequence_size, (self.loads.size() - job_sequence_size - 1))
else:
self.start = self.np_random.randint(job_sequence_size, (self.batch_job_slice - job_sequence_size - 1))
#self.start = start
self.start_idx_last_reset = self.start
self.num_job_in_batch = job_sequence_size
self.last_job_in_batch = self.start + self.num_job_in_batch
self.current_timestamp = self.loads[self.start].submit_time
self.job_queue.append(self.loads[self.start])
self.next_arriving_job_idx = self.start + 1
def skip_for_resources_greedy(self, job, scheduled_logs):
#note that this function is only called when current job can not be scheduled.
assert not self.cluster.can_allocated(job)
while not self.cluster.can_allocated(job):
# schedule nothing, just move forward to next timestamp. It should just add a new job or finish a running job
assert self.running_jobs
self.running_jobs.sort(key=lambda running_job: (running_job.scheduled_time + running_job.run_time))
next_resource_release_time = (self.running_jobs[0].scheduled_time + self.running_jobs[0].run_time)
next_resource_release_machines = self.running_jobs[0].allocated_machines
if self.next_arriving_job_idx < self.last_job_in_batch and self.loads[self.next_arriving_job_idx].submit_time <= next_resource_release_time:
self.current_timestamp = max(self.current_timestamp, self.loads[self.next_arriving_job_idx].submit_time)
self.job_queue.append(self.loads[self.next_arriving_job_idx])
self.next_arriving_job_idx += 1
else:
self.current_timestamp = max(self.current_timestamp, next_resource_release_time)
self.cluster.release(next_resource_release_machines)
self.running_jobs.pop(0) # remove the first running job.
#@profile
def moveforward_for_resources_backfill_greedy(self, job, scheduled_logs):
#note that this function is only called when current job can not be scheduled.
assert not self.cluster.can_allocated(job)
earliest_start_time = self.current_timestamp
# sort all running jobs by estimated finish time
self.running_jobs.sort(key=lambda running_job: (running_job.scheduled_time + running_job.request_time))
free_processors = self.cluster.free_node * self.cluster.num_procs_per_node
for running_job in self.running_jobs:
free_processors += len(running_job.allocated_machines) * self.cluster.num_procs_per_node
earliest_start_time = (running_job.scheduled_time + running_job.request_time)
if free_processors >= job.request_number_of_processors:
break
while not self.cluster.can_allocated(job):
# try to backfill as many jobs as possible. Use FCFS
self.job_queue.sort(key=lambda _j: self.fcfs_score(_j))
job_queue_iter_copy = list(self.job_queue)
for _j in job_queue_iter_copy:
if (self.current_timestamp + _j.request_time) < earliest_start_time:
if self.cluster.can_allocated(_j):
# we should be OK to schedule the job now
assert _j.scheduled_time == -1 # this job should never be scheduled before.
_j.scheduled_time = self.current_timestamp
_j.allocated_machines = self.cluster.allocate(_j.job_id, _j.request_number_of_processors)
self.running_jobs.append(_j)
score = self.job_score(_j) # calculated reward
scheduled_logs[_j.job_id] = score
self.job_queue.remove(_j) # remove the job from job queue
# move to the next timestamp
assert self.running_jobs
self.running_jobs.sort(key=lambda running_job: (running_job.scheduled_time + running_job.run_time))
next_resource_release_time = (self.running_jobs[0].scheduled_time + self.running_jobs[0].run_time)
next_resource_release_machines = self.running_jobs[0].allocated_machines
if self.next_arriving_job_idx < self.last_job_in_batch \
and self.loads[self.next_arriving_job_idx].submit_time <= next_resource_release_time:
self.current_timestamp = max(self.current_timestamp, self.loads[self.next_arriving_job_idx].submit_time)
self.job_queue.append(self.loads[self.next_arriving_job_idx])
self.next_arriving_job_idx += 1
else:
self.current_timestamp = max(self.current_timestamp, next_resource_release_time)
self.cluster.release(next_resource_release_machines)
self.running_jobs.pop(0) # remove the first running job
def post_process_score(self, scheduled_logs):
if self.job_score_type == 0:
# bsld
for i in scheduled_logs:
scheduled_logs[i] /= self.num_job_in_batch
elif self.job_score_type == 1:
# wait time
for i in scheduled_logs:
scheduled_logs[i] /= self.num_job_in_batch
elif self.job_score_type == 2:
# turnaround time
for i in scheduled_logs:
scheduled_logs[i] /= self.num_job_in_batch
elif self.job_score_type == 3:
total_cpu_hour = (self.current_timestamp - self.loads[self.start].submit_time)*self.loads.max_procs
for i in scheduled_logs:
scheduled_logs[i] /= total_cpu_hour
elif self.job_score_type == 4:
for i in scheduled_logs:
scheduled_logs[i] /= self.num_job_in_batch
else:
raise NotImplementedError
#@profile
def schedule_curr_sequence_reset(self, score_fn):
# schedule the sequence of jobs using heuristic algorithm.
scheduled_logs = {}
# f = False
# if score_fn.__name__ == "sjf_score":
# f = True
# num_total = 0
# start_time = time.time()
while True:
self.job_queue.sort(key=lambda j: score_fn(j))
job_for_scheduling = self.job_queue[0]
# if f:
# num_total += 1
# if selected job needs more resources, skip scheduling and try again after adding new jobs or releasing some resources
if not self.cluster.can_allocated(job_for_scheduling):
if self.backfil:
self.moveforward_for_resources_backfill_greedy(job_for_scheduling, scheduled_logs)
else:
self.skip_for_resources_greedy(job_for_scheduling, scheduled_logs)
assert job_for_scheduling.scheduled_time == -1 # this job should never be scheduled before.
job_for_scheduling.scheduled_time = self.current_timestamp
job_for_scheduling.allocated_machines = self.cluster.allocate(job_for_scheduling.job_id,
job_for_scheduling.request_number_of_processors)
self.running_jobs.append(job_for_scheduling)
score = self.job_score(job_for_scheduling) # calculated reward
scheduled_logs[job_for_scheduling.job_id] = score
self.job_queue.remove(job_for_scheduling)
not_empty = self.moveforward_for_job()
if not not_empty:
break
self.post_process_score(scheduled_logs)
# if f:
# print((time.time()-start_time)/num_total, num_total)
# reset again
self.cluster.reset()
self.loads.reset()
self.job_queue = []
self.running_jobs = []
self.visible_jobs = []
self.pairs = []
self.current_timestamp = self.loads[self.start].submit_time
self.job_queue.append(self.loads[self.start])
self.last_job_in_batch = self.start + self.num_job_in_batch
self.next_arriving_job_idx = self.start + 1
if self.enable_preworkloads:
self.refill_preworkloads()
return scheduled_logs
def build_critic_observation(self):
vector = np.zeros(JOB_SEQUENCE_SIZE * 3,dtype=float)
earlist_job = self.loads[self.start_idx_last_reset]
earlist_submit_time = earlist_job.submit_time
pairs = []
for i in range(self.start_idx_last_reset, self.last_job_in_batch+1):
job = self.loads[i]
submit_time = job.submit_time - earlist_submit_time
request_processors = job.request_number_of_processors
request_time = job.request_time
normalized_submit_time = min(float(submit_time) / float(MAX_WAIT_TIME), 1.0 - 1e-5)
normalized_run_time = min(float(request_time) / float(self.loads.max_exec_time), 1.0 - 1e-5)
normalized_request_nodes = min(float(request_processors) / float(self.loads.max_procs), 1.0 - 1e-5)
pairs.append([normalized_submit_time, normalized_run_time, normalized_request_nodes])
for i in range(JOB_SEQUENCE_SIZE):
vector[i*3:(i+1)*3] = pairs[i]
return vector
def build_observation(self):
vector = np.zeros((MAX_QUEUE_SIZE) * JOB_FEATURES, dtype=float)
self.job_queue.sort(key=lambda job: self.fcfs_score(job))
self.visible_jobs = []
for i in range(0, MAX_QUEUE_SIZE):
if i < len(self.job_queue):
self.visible_jobs.append(self.job_queue[i])
else:
break
self.visible_jobs.sort(key=lambda j: self.fcfs_score(j))
if self.shuffle:
random.shuffle(self.visible_jobs)
#@ddai: optimize the observable jobs
self.visible_jobs = []
if len(self.job_queue) <= MAX_QUEUE_SIZE:
for i in range(0, len(self.job_queue)):
self.visible_jobs.append(self.job_queue[i])
else:
visible_f1 = []
f1_index = 0
self.job_queue.sort(key=lambda job: self.f1_score(job))
for i in range(0, MAX_QUEUE_SIZE):
visible_f1.append(self.job_queue[i])
visible_f2 = []
f2_index = 0
self.job_queue.sort(key=lambda job: self.f2_score(job))
for i in range(0, MAX_QUEUE_SIZE):
visible_f2.append(self.job_queue[i])
visible_sjf = []
sjf_index = 0
self.job_queue.sort(key=lambda job: self.sjf_score(job))
for i in range(0, MAX_QUEUE_SIZE):
visible_sjf.append(self.job_queue[i])
visible_small = []
small_index = 0
self.job_queue.sort(key=lambda job: self.smallest_score(job))
for i in range(0, MAX_QUEUE_SIZE):
visible_small.append(self.job_queue[i])
visible_random = []
random_index = 0
shuffled = list(self.job_queue)
shuffle(shuffled)
for i in range(0, MAX_QUEUE_SIZE):
visible_random.append(shuffled[i])
index = 0
while index < MAX_QUEUE_SIZE:
f1_job = visible_f1[f1_index]
f1_index += 1
f2_job = visible_f2[f2_index]
f2_index += 1
sjf_job = visible_sjf[sjf_index]
sjf_index += 1
small_job = visible_small[small_index]
small_index += 1
random_job = visible_sjf[random_index]
random_index += 1
#if (not f1_job in self.visible_jobs) and index < MAX_QUEUE_SIZE:
# self.visible_jobs.append(f1_job)
# index += 1
#if (not f2_job in self.visible_jobs) and index < MAX_QUEUE_SIZE:
# self.visible_jobs.append(f2_job)
# index += 1
if (not sjf_job in self.visible_jobs) and index < MAX_QUEUE_SIZE:
self.visible_jobs.append(sjf_job)
index += 1
if (not small_job in self.visible_jobs) and index < MAX_QUEUE_SIZE:
self.visible_jobs.append(small_job)
index += 1
if (not random_job in self.visible_jobs) and index < MAX_QUEUE_SIZE:
self.visible_jobs.append(random_job)
index += 1
'''
@ddai: OPTIMIZE_OBSV. This time, we calculate the earliest start time of each job and expose that to the RL agent.
if it is 0, then the job can start now, if it is near 1, that means it will have to wait for a really long time to start.
The earliest start time is calculated based on current resources and the running jobs. It assumes no more jobs will be scheduled.
# calculate the free resources at each outstanding ts
free_processors_pair = []
free_processors = (self.cluster.free_node * self.cluster.num_procs_per_node)
free_processors_pair.append((free_processors, 0))
self.running_jobs.sort(key=lambda running_job: (running_job.scheduled_time + running_job.run_time))
for rj in self.running_jobs:
free_processors += rj.request_number_of_processors
free_processors_pair.append((free_processors, (rj.scheduled_time + rj.run_time - self.current_timestamp)))
'''
self.pairs = []
add_skip = False
for i in range(0, MAX_QUEUE_SIZE):
if i < len(self.visible_jobs) and i < (MAX_QUEUE_SIZE ):
job = self.visible_jobs[i]
submit_time = job.submit_time
request_processors = job.request_number_of_processors
request_time = job.request_time
# run_time = job.run_time
wait_time = self.current_timestamp - submit_time
# make sure that larger value is better.
normalized_wait_time = min(float(wait_time) / float(MAX_WAIT_TIME), 1.0 - 1e-5)
normalized_run_time = min(float(request_time) / float(self.loads.max_exec_time), 1.0 - 1e-5)
normalized_request_nodes = min(float(request_processors) / float(self.loads.max_procs), 1.0 - 1e-5)
'''
@ddai: part 2 of OPTIMIZE_OBSV
earliest_start_time = 1
for fp, ts in free_processors_pair:
if request_processors < fp:
earliest_start_time = ts
break
normalized_earliest_start_time = min(float(earliest_start_time) / float(MAX_WAIT_TIME), 1.0 - 1e-5)
'''
# add extra parameters, include "Requested Memory", "User Id", "Groupd Id", "Exectuable Id", if its value does not exist in the trace (-1), we set it to 1 by default.
if job.request_memory == -1:
normalized_request_memory = 1
else:
normalized_request_memory = min(float(job.request_memory)/float(self.loads.max_requested_memory), 1.0 - 1e-5)
if job.user_id == -1:
normalized_user_id = 1
else:
normalized_user_id = min(float(job.user_id)/float(self.loads.max_user_id), 1.0-1e-5)
if job.group_id == -1:
normalized_group_id = 1
else:
normalized_group_id = min(float(job.group_id)/float(self.loads.max_group_id), 1.0-1e-5)
if job.executable_number == -1:
normalized_executable_id = 1
else:
normalized_executable_id = min(float(job.executable_number)/float(self.loads.max_executable_number), 1.0-1e-5)
if self.cluster.can_allocated(job):
can_schedule_now = 1.0 - 1e-5
else:
can_schedule_now = 1e-5
self.pairs.append([job,normalized_wait_time, normalized_run_time, normalized_request_nodes, normalized_request_memory, normalized_user_id, normalized_group_id, normalized_executable_id, can_schedule_now])
elif self.skip and not add_skip: # the next job is skip
add_skip = True
if self.pivot_job:
self.pairs.append([None, 1, 1, 1, 1, 1, 1, 1, 1])
else:
self.pairs.append([None, 1, 1, 1, 1, 1, 1, 1, 0])
else:
self.pairs.append([None,0,1,1,1,1,1,1,0])
for i in range(0, MAX_QUEUE_SIZE):
vector[i*JOB_FEATURES:(i+1)*JOB_FEATURES] = self.pairs[i][1:]
return vector
#@profile
def moveforward_for_resources_backfill(self, job):
#note that this function is only called when current job can not be scheduled.
assert not self.cluster.can_allocated(job)
earliest_start_time = self.current_timestamp
# sort all running jobs by estimated finish time
self.running_jobs.sort(key=lambda running_job: (running_job.scheduled_time + running_job.request_time))
free_processors = self.cluster.free_node * self.cluster.num_procs_per_node
for running_job in self.running_jobs:
free_processors += len(running_job.allocated_machines) * self.cluster.num_procs_per_node
earliest_start_time = (running_job.scheduled_time + running_job.request_time)
if free_processors >= job.request_number_of_processors:
break
while not self.cluster.can_allocated(job):
# try to backfill as many jobs as possible. Use FCFS
self.job_queue.sort(key=lambda _j: self.fcfs_score(_j))
job_queue_iter_copy = list(self.job_queue)
for _j in job_queue_iter_copy:
if self.cluster.can_allocated(_j) and (self.current_timestamp + _j.request_time) < earliest_start_time:
# we should be OK to schedule the job now
assert _j.scheduled_time == -1 # this job should never be scheduled before.
_j.scheduled_time = self.current_timestamp
_j.allocated_machines = self.cluster.allocate(_j.job_id, _j.request_number_of_processors)
self.running_jobs.append(_j)
score = self.job_score(_j) # calculated reward
self.scheduled_rl[_j.job_id] = score
self.job_queue.remove(_j) # remove the job from job queue
# move to the next timestamp
assert self.running_jobs
self.running_jobs.sort(key=lambda running_job: (running_job.scheduled_time + running_job.run_time))
next_resource_release_time = (self.running_jobs[0].scheduled_time + self.running_jobs[0].run_time)
next_resource_release_machines = self.running_jobs[0].allocated_machines
if self.next_arriving_job_idx < self.last_job_in_batch \
and self.loads[self.next_arriving_job_idx].submit_time <= next_resource_release_time:
self.current_timestamp = max(self.current_timestamp, self.loads[self.next_arriving_job_idx].submit_time)
self.job_queue.append(self.loads[self.next_arriving_job_idx])
self.next_arriving_job_idx += 1
else:
self.current_timestamp = max(self.current_timestamp, next_resource_release_time)
self.cluster.release(next_resource_release_machines)
self.running_jobs.pop(0) # remove the first running job
def skip_for_resources(self, job):
#note that this function is only called when current job can not be scheduled.
assert not self.cluster.can_allocated(job)
while not self.cluster.can_allocated(job):
# schedule nothing, just move forward to next timestamp. It should just add a new job or finish a running job
assert self.running_jobs
self.running_jobs.sort(key=lambda running_job: (running_job.scheduled_time + running_job.run_time))
next_resource_release_time = (self.running_jobs[0].scheduled_time + self.running_jobs[0].run_time)
next_resource_release_machines = self.running_jobs[0].allocated_machines
if self.next_arriving_job_idx < self.last_job_in_batch and self.loads[self.next_arriving_job_idx].submit_time <= next_resource_release_time:
self.current_timestamp = max(self.current_timestamp, self.loads[self.next_arriving_job_idx].submit_time)
self.job_queue.append(self.loads[self.next_arriving_job_idx])
self.next_arriving_job_idx += 1
else:
self.current_timestamp = max(self.current_timestamp, next_resource_release_time)
self.cluster.release(next_resource_release_machines)
self.running_jobs.pop(0) # remove the first running job.
#@profile
def moveforward_for_job(self):
if self.job_queue:
return True
# if we need to add job, but can not add any more, return False indicating the job_queue is for sure empty now.
if self.next_arriving_job_idx >= self.last_job_in_batch:
assert not self.job_queue
return False
# move forward to add jobs into job queue.
while not self.job_queue:
if not self.running_jobs: # there are no running jobs
next_resource_release_time = sys.maxsize # always add jobs if no resource can be released.
next_resource_release_machines = []
else:
self.running_jobs.sort(key=lambda running_job: (running_job.scheduled_time + running_job.run_time))
next_resource_release_time = (self.running_jobs[0].scheduled_time + self.running_jobs[0].run_time)
next_resource_release_machines = self.running_jobs[0].allocated_machines
if self.loads[self.next_arriving_job_idx].submit_time <= next_resource_release_time:
self.current_timestamp = max(self.current_timestamp, self.loads[self.next_arriving_job_idx].submit_time)
self.job_queue.append(self.loads[self.next_arriving_job_idx])
self.next_arriving_job_idx += 1
return True # job added
else:
self.current_timestamp = max(self.current_timestamp, next_resource_release_time)
self.cluster.release(next_resource_release_machines)
self.running_jobs.pop(0) # remove the first running job.
def job_score(self, job_for_scheduling):
# 0: Average bounded slowdown, 1: Average waiting time
# 2: Average turnaround time, 3: Resource utilization 4: Average slowdown
if self.job_score_type == 0:
# bsld
_tmp = max(1.0, (float(job_for_scheduling.scheduled_time - job_for_scheduling.submit_time + job_for_scheduling.run_time)
/
max(job_for_scheduling.run_time, 10)))
elif self.job_score_type == 1:
#wait time
_tmp = float(job_for_scheduling.scheduled_time - job_for_scheduling.submit_time)
elif self.job_score_type == 2:
# turnaround time
_tmp = float(job_for_scheduling.scheduled_time - job_for_scheduling.submit_time + job_for_scheduling.run_time)
elif self.job_score_type == 3:
# utilization
_tmp = -float(job_for_scheduling.run_time*job_for_scheduling.request_number_of_processors)
elif self.job_score_type == 4:
# sld
_tmp = float(job_for_scheduling.scheduled_time - job_for_scheduling.submit_time + job_for_scheduling.run_time)\
/job_for_scheduling.run_time
else:
raise NotImplementedError
# Weight larger jobs.
#_tmp = _tmp * (job_for_scheduling.run_time * job_for_scheduling.request_number_of_processors)
return _tmp
def has_only_one_job(self):
if len(self.job_queue) == 1:
return True
else:
return False
def skip_schedule(self):
# schedule nothing, just move forward to next timestamp. It should 1) add a new job; 2) finish a running job; 3) reach skip time
next_time_after_skip = self.current_timestamp + SKIP_TIME
next_resource_release_time = sys.maxsize # always add jobs if no resource can be released.
next_resource_release_machines = []
if self.running_jobs: # there are running jobs
self.running_jobs.sort(key=lambda running_job: (running_job.scheduled_time + running_job.run_time))
next_resource_release_time = (self.running_jobs[0].scheduled_time + self.running_jobs[0].run_time)
next_resource_release_machines = self.running_jobs[0].allocated_machines
if self.next_arriving_job_idx >= self.last_job_in_batch and not self.running_jobs:
if not self.pivot_job:
self.pivot_job = True
return False, 0
else:
return False, 0
if next_time_after_skip < min(self.loads[self.next_arriving_job_idx].submit_time, next_resource_release_time):
self.current_timestamp = next_time_after_skip
return False, 0
if self.next_arriving_job_idx < self.last_job_in_batch and self.loads[self.next_arriving_job_idx].submit_time <= next_resource_release_time:
self.current_timestamp = max(self.current_timestamp, self.loads[self.next_arriving_job_idx].submit_time)
self.job_queue.append(self.loads[self.next_arriving_job_idx])
self.next_arriving_job_idx += 1
else:
self.current_timestamp = max(self.current_timestamp, next_resource_release_time)
self.cluster.release(next_resource_release_machines)
self.running_jobs.pop(0) # remove the first running job.
return False, 0
def schedule(self, job_for_scheduling):
# make sure we move forward and release needed resources
if not self.cluster.can_allocated(job_for_scheduling):
if self.backfil:
self.moveforward_for_resources_backfill(job_for_scheduling)
else:
self.skip_for_resources(job_for_scheduling)
# we should be OK to schedule the job now
assert job_for_scheduling.scheduled_time == -1 # this job should never be scheduled before.
job_for_scheduling.scheduled_time = self.current_timestamp
job_for_scheduling.allocated_machines = self.cluster.allocate(job_for_scheduling.job_id, job_for_scheduling.request_number_of_processors)
self.running_jobs.append(job_for_scheduling)
score = self.job_score(job_for_scheduling) # calculated reward
self.scheduled_rl[job_for_scheduling.job_id] = score
self.job_queue.remove(job_for_scheduling) # remove the job from job queue
# after scheduling, check if job queue is empty, try to add jobs.
not_empty = self.moveforward_for_job()
if not_empty:
# job_queue is not empty
return False
else:
# job_queue is empty and can not add new jobs as we reach the end of the sequence
return True
def valid(self, a):
action = a[0]
return self.pairs[action][0]
#@profile
def step(self, a):
job_for_scheduling = self.pairs[a][0]
if not job_for_scheduling:
done, _ = self.skip_schedule()
else:
job_for_scheduling = self.pairs[a][0]
done = self.schedule(job_for_scheduling)
if not done:
obs = self.build_observation()
return [obs, 0, False, 0, 0, 0]
else:
self.post_process_score(self.scheduled_rl)
rl_total = sum(self.scheduled_rl.values())
best_total = min(self.scheduled_scores)
sjf = self.scheduled_scores[0]
f1 = self.scheduled_scores[1]
rwd2 = (best_total - rl_total)
rwd = -rl_total
'''
if (best_total) < rl_total:
rwd = -1
elif best_total == rl_total:
rwd = 0
else:
rwd = 1
'''
return [None, rwd, True, rwd2, sjf, f1]
def step_for_test(self, a):
job_for_scheduling = self.pairs[a][0]
if not job_for_scheduling:
# print("SKIP", end=" ")
done, _ = self.skip_schedule()
else:
job_for_scheduling = self.pairs[a][0]
done = self.schedule(job_for_scheduling)
if not done:
obs = self.build_observation()
return [obs, 0, False, None]
else:
self.post_process_score(self.scheduled_rl)
rl_total = sum(self.scheduled_rl.values())
return [None, rl_total, True, None]
