LACS: Learning-Augmented Algorithms for Carbon-Aware Resource Scaling with Uncertain Demand
Roozbeh Bostandoost, Adam Lechowicz, Walid A. Hanafy, Noman Bashir,, Prashant Shenoy, and Mohammad Hajiesmaili

TL;DR
This paper introduces LACS, a learning-augmented online algorithm for carbon-aware resource scaling in data centers that accounts for uncertain job lengths and switching costs, reducing carbon emissions effectively.
Contribution
LACS is the first robust learning-augmented algorithm addressing online carbon-aware resource scaling with unknown job lengths and switching costs.
Findings
LACS achieves within 1.2% of the online baseline with perfect job length info.
LACS reduces carbon footprint by 32% compared to carbon-agnostic methods.
Experimental results validate LACS's practical effectiveness and theoretical robustness.
Abstract
Motivated by an imperative to reduce the carbon emissions of cloud data centers, this paper studies the online carbon-aware resource scaling problem with unknown job lengths (OCSU) and applies it to carbon-aware resource scaling for executing computing workloads. The task is to dynamically scale resources (e.g., the number of servers) assigned to a job of unknown length such that it is completed before a deadline, with the objective of reducing the carbon emissions of executing the workload. The total carbon emissions of executing a job originate from the emissions of running the job and excess carbon emitted while switching between different scales (e.g., due to checkpoint and resume). Prior work on carbon-aware resource scaling has assumed accurate job length information, while other approaches have ignored switching losses and require carbon intensity forecasts. These assumptions…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
