Solver-Free and Cost-Aware Online Scheduling of AI Data Center Tasks
Organizations: School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore · Department of Electrical and Electronic Engineering, Imperial College London, London, UK
Abstract
AI data centers receive computing tasks continuously, whereas solver-based optimization takes time to run and electricity is priced per settlement period. This paper bridges this timing gap through a solver-free online optimization rule inspired by dual decomposition. The rule assigns each task a start period upon arrival to optimize energy cost subject to operational constraints, shifting flexible tasks toward low-price periods while keeping high-priority tasks on schedule. Simulations on the A100 GPU trace (3,456 GPUs, 1,343 tasks) show that the proposed rule keeps GPU and CPU use within capacity while scheduling tasks at low cost. Compared with a multi-timescale optimization benchmark, it achieves a lower cost and, because it needs no solver, much less computation time.
Figures & tables
| Symbol | Meaning |
|---|---|
| Time period, | |
| Resource: GPU or vCPU | |
| , | Task submitted; set of all and high-priority (HP) tasks |
| Set of possible start periods of task | |
| Set of feasible start periods of task (fit free capacity) | |
| Operation period length |
| Parameter | Value | Parameter | Value |
| Horizon | 26 h | , Spot | 120 (120 min) |
| Period length | 1 min | Benchmark 2 update | 5 min |
| , HP | 0 | Offline MILP gap | |
| , Priority | 60 (60 min) | Offline time limit | 600 s |
| Method | Flexible-task cost ($) | Cost above offline (%) | Late HP tasks (#) | Time per decision (ms) |
|---|---|---|---|---|
| Benchmark 1 | 378.02 | 12.9 | 0 | 0.032 |
| Benchmark 2 | 341.27 | 1.9 | 7 | 41.4 |
| Proposed | 340.74 | 1.7 | 0 | 0.024 |
| Perfect | 334.97 | 0 | 0 | 52,800 |
Online Resource Allocation
Online resource allocation studies how to assign scarce capacity to arriving requests under uncertainty while balancing reward, cost, fairness, and feasibility.
See all 100 papers