arXiv · 2611.22239
Solver-Free and Cost-Aware Online Scheduling of AI Data Center Tasks
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Xin Qin, Dawei Qiu, Fei Teng. 2026-11-17. Solver-Free and Cost-Aware Online Scheduling of AI Data Center Tasks. https://searcharxiv.com/abs/2611.22239
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.