AI & ML
Solver-Free and Cost-Aware Online Scheduling of AI Data Center Tasks
arXiv cs.SY0 views
arXiv:2611.22239v1 Announce Type: new 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.
Source:https://arxiv.org/abs/2611.22239PreviousSafely Mitigating Grid Imbalance: A Hybrid Distributional Wide-Margin Recourse ApproachNextOptimal Energy and LLM Task Scheduling for Multiple Cloud Data Centers
Related posts
BenchAudit – Auditing LLM benchmarks for leaks, data reuse, and harness gaps
0Hacker News New
Guillotine DJ – Announcement Trailer
0Hacker News New
Researchers hijack Hugging Face account for popular Kokoro AI model
0Hacker News New
Automated LLM Fine-Tuning: GPU Selection, Dataset Analysis and Feedback
0Hacker News New
Human-written Launch HN posts get more upvotes than AI-generated ones
0Hacker News New

Parallels Desktop review
0TechRadar