29 lines
1.5 KiB
Python
29 lines
1.5 KiB
Python
"""Pure budget decisions for the planned S3-A queue; no task launch."""
|
|
import math
|
|
|
|
|
|
def first_fit_projection(c, first_by_arm):
|
|
estimates = {}
|
|
for arm in ('R2_E4', 'R2_G2'):
|
|
first = first_by_arm[arm]
|
|
if first['status'] != 'PASS':
|
|
return dict(continue_within_cap=False, reason='FIRST_TRIAL_FAILED_NO_RETRY', arm=arm)
|
|
jobs = [j for j in c['jobs'] if j['arm'] == arm]
|
|
initial = jobs[0]
|
|
cpu, fit = first['worker_cpu_seconds'], first['fit_cpu_seconds']
|
|
if not math.isfinite(cpu) or not math.isfinite(fit) or not 0 <= fit <= cpu:
|
|
raise ValueError('Invalid first fit CPU accounting')
|
|
estimates[arm] = cpu + 1.25 * (fit / initial['cost_units'] * sum(j['cost_units'] for j in jobs[1:])
|
|
+ (cpu-fit) * sum(j['cost_queries']/initial['cost_queries'] for j in jobs[1:]))
|
|
total = sum(estimates.values())
|
|
return dict(continue_within_cap=total <= c['limits']['fitting_worker_cpu_seconds'],
|
|
projected_fitting_worker_cpu_seconds=total, by_arm=estimates,
|
|
method='Per-arm actual first trial; cost/query scaling,25percent reserve; heuristic')
|
|
|
|
|
|
def can_dispatch(c, settled_cpu, live_charged_cpu, active_remaining_caps, next_cap):
|
|
values = [settled_cpu, live_charged_cpu, next_cap, *active_remaining_caps]
|
|
if any(not math.isfinite(v) or v < 0 for v in values) or next_cap <= 0:
|
|
raise ValueError('Unknown/invalid CPU accounting blocks dispatch')
|
|
return sum(values) <= c['limits']['fitting_worker_cpu_seconds']
|