betaFeedback

WorksMathematics

Optimal Scheduling of Multi-Site AI Data Centers in Day-Ahead Markets

Abstract

AI data centers are among the fastest-growing loads on the power grid, and their flexibility is increasingly sought by grid operators. Using it requires a model that links what an operator controls, namely GPU power caps, job timing and job placement, to the power drawn at each site and the electricity prices it faces. This paper develops such a framework for a multi-site AI data-center fleet. It represents GPU power-cap levels; deferrable jobs with deadlines and inference with response-time headroom; and site facility power, and casts the fleet schedule as a linear program solved on day-ahead prices. A year-long simulation on 2025 California Independent System Operator (CAISO) day-ahead prices in three data-center markets demonstrates the framework. Coordinated scheduling lowers the fleet's energy cost by 6.3% at equal work. Four operating modes, each adding one capability, split this saving into efficient GPU operation that needs no price signal, price response in time, and routing work between sites.

Introduction

U.S. data centers used 4.7% of the nation’s electricity in 2024 and may use 9.5–15.3% by 2030 [1], driven mainly by AI servers. About 100 GW of new large load could connect if curtailed by about 0.5% of its maximum annual energy use [2]. Field tests have held a GPU cluster 25% below baseline for three hours during a grid peak [3] and, in a later London trial, cut a cluster’s demand by up to 40% and followed reduction requests lasting up to 10 h [4]. Much of an AI fleet’s work can be paused, capped or deferred [5], and an operator with several sites can also move it [6].

Turning this potential into grid value requires a model that connects the operator’s controls to the grid. On the data-center side, the controls act on individual GPUs and jobs: a power cap trades throughput for power, training can pause and resume from checkpoints, offline jobs have deadlines, and inference must meet response-time targets. On the grid side, what matters is each site’s facility power, including cooling, and the locational prices and market rules it faces. Geographic load balancing [6] and carbon-aware scheduling [5] move work between sites and over time, respectively, but do not model GPU power caps. Grid studies, conversely, typically assume that a fixed share of data-center load can be deferred [7, 8]; a trace of 155,410 GPUs instead derived flexibility from the workloads eligible to curtail and found that it averages about 6% of facility power [9].

Such a model must also be clear about where savings come from. An AI fleet that faces electricity prices can lower its bill in three ways. It can run GPUs at lower power caps, which finishes the same work with less energy at any price. It can shift work in time, toward hours when power is cheap. And it can move work between sites, toward whichever site has cheaper power at that moment. Only the last two respond to prices, yet all three appear as savings when an optimized schedule is compared with a fleet that runs every job at full power on arrival, which counts efficiency as flexibility.

This paper makes the following contributions:

  1. A scheduling framework for a multi-site AI data-center fleet that links GPU power-cap levels and workload constraints to site facility power and locational electricity prices. It is a linear program that sets each site’s hourly power a day ahead from day-ahead (DA) prices.

  1. A year-long demonstration on 2025 CAISO DA prices in three data-center markets. Four operating modes, each adding one capability, split the saving into efficiency, price response in time and routing between sites, with confidence intervals. Coordinated scheduling saves 6.3% at equal work; efficiency and price response carry nearly all of it, and routing adds a small share, mainly on days when prices at the sites diverge.

Because the framework ties GPU-level controls to grid-facing quantities, it provides a basis for valuing data-center grid services such as demand response and reserves.

The rest of this paper is organized as follows. Section II models the fleet and its operating modes. Section III describes the simulation setup, Section IV presents the results, and Section V concludes this work.

Fleet Scheduling Model

A data center fleet operator manages a fleet of data centers over time windows of length Δ\Delta indexed by tt, so that the tt-th time window corresponds to the time interval [(t−1)Δ,tΔ][(t-1)\Delta,t\Delta]. Each data center ii hosts NiN_i identical GPUs. The fleet operator sets for every time interval 1) how many GPUs are assigned to each computational job, 2) at which power cap the GPUs run, and 3) when sites are coordinated, to which site movable work is transferred.

We assume for simplicity that the fleet is a price taker, i.e., the fleet operator schedules against locational marginal prices (LMPs) which are not affected by the data center loads. We will cast the fleet operator scheduling program as a linear program (LP), which can be efficiently solved by off the shelf methods, with continuous decision variables. The formulation follows geographic load balancing [6], with per-job deadlines in place of the daily completion window of [5].

We assume two types of work here. Deferrable jobs, indexed by mm, must finish by a deadline but may be paused, slowed and, in some cases, moved to other sites. They range from training runs that last weeks, use thousands of GPUs and are pinned to their site, to short jobs such as fine-tuning, evaluation and data processing that last hours and may run at any site. Inference serves live user requests that cannot wait; it is indexed as m=infm = \mathrm{inf} so that sums over mm in the following include it.

NOTATION
Indices
ii, jj; tt, Δ\Delta, HHsites; time step, its length, horizon end
kk, KKpower-cap level; uncapped (natural) level
mmdeferrable job (training run or short job), or inference
Variables
nm,i,t,kn_{m,i,t,k}GPUs of job mm at site ii in step tt at level kk
um,i,tu_{m,i,t}GPUs of job mm that start up in step tt
ym,iy_{m,i}share of job mm placed at site ii
qj,i,tq_{j,i,t}inference demand from site jj served at site ii
wm,i,tw_{m,i,t}; Pi,tP_{i,t}remaining work (GPU-h); facility power (MW)
Parameters
ϕm,k\phi_{m,k}, rm,kr_{m,k}GPU power (TDP share), relative throughput of mm at kk
pm,kidlep^{\mathrm{idle}}_{m,k}, pm,kp_{m,k}power of an idle GPU slot; extra power of a busy one
pTDPp^{\mathrm{TDP}}, p0p^0GPU TDP; fixed extra power of a busy slot
NiN_i, Pˉi\bar{P}_inumber of GPUs and power limit of site ii
WmW_m, GmG_m, sms_mwork at arrival (GPU-h), GPU limit, cost to move ($)
imi_m, ama_m, dmd_mhome site, arrival step, deadline of job mm
δ\deltawork lost per restarted GPU (h)
Qj,tQ_{j,t}; ρˉ\bar{\rho}inference demand arising at site jj; utilization cap
PUEfacility power divided by IT power
λi,t\lambda_{i,t}DA electricity price ($/MWh)
πlate\pi^{\mathrm{late}}, πroute\pi^{\mathrm{route}}prices of lateness and inference routing
vmv_m; κ\kappavalue of leftover work; value of GPU time

Table 1.

In the following, Sections II-A–II-E build the LP; Section II-F describes the day ahead (DA) schedule and the four operating modes we compare. Figure 1 shows how the pieces fit together at one site, and Table I summarizes the notation.

The scheduling model at one site $i$, showing inference and deferrable jobs, GPU pool, facility power, DA price, and throughput against GPU power

Figure 1. The scheduling model at one site ii. Inset: throughput against GPU power at the levels of Table II.

GPU Power Levels

Power capping [10] lets a GPU run at a few discrete levels kk, which depend on its workload class. A GPU assigned to job mm at level kk draws a fraction ϕm,k\phi_{m,k} of its thermal design power (TDP) and has corresponding relative throughput rm,kr_{m,k}: one hour at level kk completes rm,kr_{m,k} GPU-hours of uncapped work. The last level KK is the natural, uncapped draw, with rm,K=1r_{m,K} = 1. We assume a GPU can also split a step between two levels; it then averages their power and throughput and operates on the straight line between them; see the inset of Figure 1. Throughput is therefore a piecewise-linear function of power. The levels show diminishing returns: each extra watt buys less throughput, so this function is concave. This allows us to trade off GPU throughput for power saving, especially in presence of flexible job deadlines. We define nm,i,t,kn_{m,i,t,k} as the number of GPUs allocated to job mm at site ii and time interval tt capped at the power level kk. For simplicity, we consider nm,i,t,kn_{m,i,t,k} as a continuous rather than discrete variable, given the big number of GPUs (tens of thousands) in each site.

Deferrable Jobs

Deferrable jobs are measured in GPU-hours (GPU-h) at uncapped throughput: W=1,000W = 1{,}000 GPU-h keeps 1,000 uncapped GPUs busy for one hour, or 1,000 GPUs at rm,k=0.5r_{m,k} = 0.5 for two hours. A deferrable job mm that arrives is characterized by its work WmW_m and by the maximum number of GPUs that may be allocated to it at once GmG_m. To each site ii, the schedule assigns a share ym,iy_{m,i} of job mm, with ∑iym,i=1\sum_i y_{m,i} = 1, and allocates nm,i,t,kn_{m,i,t,k} GPUs at level kk. Usually, training runs are pinned to their home site imi_m, short jobs are more easily moved. After job mm started to be processed in site ii, the remaining work left at time tt is denoted as wm,i,tw_{m,i,t} and evolves like an account balance (the tank in Figure 1) over the planning horizon, which ends at step HH:

wm,i,t+1=wm,i,t−Δ∑krm,knm,i,t,k+δum,i,t,(1)w_{m,i,t+1} = w_{m,i,t} - \Delta\sum_k r_{m,k} n_{m,i,t,k} + \delta u_{m,i,t}, \tag*{(1)}
um,i,t=max⁡{∑k(nm,i,t,k−nm,i,t−1,k),0},(2)u_{m,i,t} = \max\left\{\sum_k \left(n_{m,i,t,k} - n_{m,i,t-1,k}\right), 0\right\}, \tag*{(2)}
wm,i,am=Wmym,i,(3)w_{m,i,a_m} = W_m y_{m,i}, \tag*{(3)}
∑knm,i,t,k≤Gmym,i,(4)\sum_k n_{m,i,t,k} \le G_m y_{m,i}, \tag*{(4)}
wm,i,H≤Wmym,imax⁡{dm−Hdm−am,0}.(5)w_{m,i,H} \le W_m y_{m,i} \max\left\{\frac{d_m-H}{d_m-a_m},0\right\}. \tag*{(5)}

where um,i,tu_{m,i,t} is the GPUs of job mm that start up in step tt, and ama_m and dmd_m are the arrival step and deadline of job mm. Equation (1a) updates the remaining work by subtracting the work GPUs complete and by adding the cost of restarting GPUs: a GPU that resumes a paused job must reload the last checkpoint and redo the work done after last saving, so it spends δ\delta hours busy without progress. Equation (1b) counts the GPUs that start up: the increase in running GPUs. The LP imposes (1b) linearly as um,i,t≥∑k(nm,i,t,k−nm,i,t−1,k)u_{m,i,t} \ge\sum_k(n_{m,i,t,k} - n_{m,i,t-1,k}) and um,i,t≥0u_{m,i,t} \ge0: since restarts only add work, at the optimum, um,i,tu_{m,i,t} meets this bound. Constraints (1c) and (1d) give site ii its share of the job’s work and of its GPU limit. Constraint (1e) is a pace limit: the work left at the end of the horizon may not exceed a straight-line path to the deadline. A training run due in 10 days must finish at least 10% of its work on the first day, and a short job due within the horizon must finish completely.

Online Inference

Inference is live traffic and cannot be delayed, so it has no work balance. The demand arising at site jj, Qj,tQ_{j,t}, is measured in GPU-equivalents, the number of uncapped GPUs it would fully occupy during the time slot tt. A part qj,i,tq_{j,i,t} of it is served at site ii by ninf,i,t,kn_{\mathrm{inf},i,t,k} inference GPUs at level kk. At this DA planning stage, we assume the serving GPUs are loaded to at most a fraction ρˉ\bar{\rho} of their capacity, the same at every site, which leaves slack for bursts of requests [6, 11]. The inference constraints are:

∑iqj,i,t=Qj,t,(6)\sum_i q_{j,i,t} = Q_{j,t}, \tag*{(6)}
ρˉ∑krinf,kninf,i,t,k≥∑jqj,i,t,(7)\bar{\rho}\sum_k r_{\mathrm{inf},k} n_{\mathrm{inf},i,t,k} \ge\sum_j q_{j,i,t}, \tag*{(7)}
∑m,knm,i,t,k≤Ni.(8)\sum_{m,k} n_{m,i,t,k} \le N_i. \tag*{(8)}

Constraint (2a) serves all inference demand, (2b) gives each site enough serving GPUs for the demand it takes at utilization ρˉ\bar{\rho}, and (2c) keeps all GPUs in use (including deferrable jobs and inference) within the NiN_i GPUs of the site. In fleet mode demand may be served at any site; otherwise qj,i,t=0q_{j,i,t} = 0 for i≠ji \ne j. With ρˉ=0.8\bar{\rho} = 0.8, serving 1,000 GPU-equivalents takes 1,250 uncapped GPUs, or 1,543 at 46% of TDP. The lower cap may need more GPUs but less power overall.

Facility Power

Every GPU slot, with its share of the server, draws pidlep^{\mathrm{idle}} even when idle; a busy slot of job mm at level kk draws

pm,k=pTDPϕm,k+p0(9)p_{m,k}=p^{\mathrm{TDP}}\phi_{m,k}+p^0 \tag*{(9)}

more, where pTDPϕm,kp^{\mathrm{TDP}}\phi_{m,k} is the GPU’s power at level kk and p0p^0 is the server’s extra power when busy, net of the GPU’s idle draw. Facility power is IT power times the power usage effectiveness (PUE), which adds cooling and power-conversion losses:

Pi,t=PUE[Nipidle+∑m,kpm,knm,i,t,k]≤Pˉi.(10)P_{i,t}=\mathrm{PUE}\left[N_i p^{\mathrm{idle}}+\sum_{m,k}p_{m,k}n_{m,i,t,k}\right]\leq\bar{P}_i. \tag*{(10)}

The first term in brackets is fixed; the second depends on the schedule. We take the PUE as a constant, PUE =1.1=1.1, near the fleet averages reported by hyperscale operators [12].

Objective and Optimization Problem

The goal for the operator is to minimize the following objective function:

J=∑i,tλi,tPi,tΔ+πlate∑m,i,t≥dmwm,i,tΔ+∑m,ivmwm,i,H+∑m,i≠imsmym,i+πroute∑t∑j,i≠jqj,i,tΔ,(11)\begin{aligned} J={}&\sum_{i,t}\lambda_{i,t}P_{i,t}\Delta+\pi^{\mathrm{late}}\sum_{m,i,t\geq d_m}w_{m,i,t}\Delta\\ &+\sum_{m,i}v_m w_{m,i,H}+\sum_{m,i\ne i_m}s_m y_{m,i}\\ &+\pi^{\mathrm{route}}\sum_t\sum_{j,i\ne j}q_{j,i,t}\Delta, \tag*{(11)} \end{aligned}

where λi,t\lambda_{i,t}, πlate\pi^{\mathrm{late}}, and πroute\pi^{\mathrm{route}} are price for electricity, lateness, and inference routing. The first term captures the energy bill, the second term models a late penalty πlate\pi^{\mathrm{late}} on each GPU-hour of work still unfinished after its deadline, the third term sums the value of the work left at the end of the horizon, which must still be done later, the fourth term is the cost of moving a job’s data away from its home site, and the fifth term is a small routing cost for serving inference away from where it arises. Here, the leftover work is valued at:

vm=pm,K PUE λˉ+κ,(12)v_m=p_{m,K}\,\mathrm{PUE}\,\bar{\lambda}+\kappa, \tag*{(12)}

where the first term is the energy needed to finish the work later, at this day’s mean price λˉ\bar{\lambda}, and the second, κ\kappa in $/GPU-h, is the value of the GPU time the work will occupy, since a GPU-hour deferred today displaces other work later. The two differ greatly in scale: at $39/MWh, the energy of a training GPU-hour costs about $0.03, while an H100 GPU rents for about $2/h. $2/h is near the rental value, so training is never deferred, consistent with [9], and every mode completes the same work.

We can now cast our scheduling problem as the LP:

min⁡n,u,w,y,q,P≥0Js.t.∑iym,i=1,(1)–(4),(13)\begin{aligned} \min_{n,u,w,y,q,P\geq0}\quad&J\\ \text{s.t.}\quad&\sum_i y_{m,i}=1,\\ &(1)\text{--}(4), \tag*{(13)} \end{aligned}

with ym,im=1y_{m,i_m}=1 for training runs and in the site-level modes. The LP input parameters are the prices λ\lambda, the workload (Wm,Qj,t)(W_m,Q_{j,t}) and the starting state; its outputs are the GPU counts per level, the placement and the facility power at each site. To keep the LP always feasible, the implementation softens the pace limit (1e) and the inference balance (2a) with penalties of $20/GPU-h and $5,000 per GPU-equivalent-hour; neither is incurred in the simulation results.

DA Schedule and Operating Modes

The fleet schedules each operating day in CAISO’s DA market. The LP is solved once, in hourly steps (Δ=1\Delta=1h) over the 24 hours of the day, with the DA LMPs λi,t\lambda_{i,t} and the day’s workload. Its hourly power Pi,tP_{i,t} is the fleet’s DA purchase, which it then consumes as scheduled, so its bill is the first term of (5), ∑i,tλi,tPi,tΔ\sum_{i,t}\lambda_{i,t}P_{i,t}\Delta.

We compare four modes. Each adds one capability to the one before it, so that the difference between consecutive modes isolates one source of saving:

ParameterValue
GPUs per site90k Silicon Valley; 60k LA, San Diego
GPU TDP pTDPp^{\mathrm{TDP}}; GPU idle; server busy/idle700; 70; 450/250 W
pidlep^{\mathrm{idle}}; p0p^{0} (derived)320; 130 W
Training power-cap levels (ϕ,r)(\phi,r)(0.85, 1), (0.75, 0.96), (0.65, 0.88), (0.55, 0.76), (0.45, 0.62)
Inference power-cap levels (ϕ,r)(\phi,r)(0.70, 1), (0.63, 0.96), (0.55, 0.90), (0.46, 0.81) [13]
Short-job power-cap levels (ϕ,r)(\phi,r)(0.80, 1) … (0.40, 0.70)
Inference utilization cap ρˉ\bar{\rho}; PUE0.8; 1.1 [12]
Restart overhead δ\delta, training/short0.25/0.05 hour
πlate\pi^{\mathrm{late}}; sms_m$10/GPU-h per h; $0.01/GPU-h moved
πroute\pi^{\mathrm{route}}; κ\kappa$0.05/GPU-h; $2/GPU-h

Table II. Main parameters

  1. Uncoordinated: every job runs on arrival at its home site at full power, inference first, then training runs, then short jobs in arrival order.

  1. Price-blind: the site-level model is solved at a flat price, with a negligible preference for early work. This isolates operational efficiency.

  1. Site-level: the model is solved on LMPs, with all work and inference kept at its home site.

  1. Fleet-coordinated: the model is solved on LMPs and also optimizes routing (yy and qq).

All modes pay the DA LMPs for the power they draw. Thus (b) minus (a) measures efficiency, (c) minus (b) measures price response in time, and (d) minus (c) measures routing.

Simulation Setup

Fleet and Prices

Three sites host 210,000 GPUs in total. When run uncoordinated, they average about 190 MW with a mean daily peak of 230 MW. The sites are placed in CAISO’s three largest data-center markets, Silicon Valley, the Los Angeles basin and San Diego. Each site pays the LMP that CAISO publishes for its local area (PG&E South Bay, SCE Core and SDG&E).

The 2025 hourly DA LMPs come from CAISO’s OASIS data portal [14]. DA prices at the three sites averaged $39/MWh and peaked at $199/MWh, and midday solar output drove them below zero at some site on 102 days. Silicon Valley was the most expensive market, with an average price of $43/MWh against $35/MWh in Los Angeles.

Workload and Runs

We assume each site runs two training runs on 26% of its GPUs, with 5–30 days left to run and a 15% deadline slack. These runs are pinned to their cluster, as large synchronous runs are. Short jobs arrive following a business-day profile, totaling 19% of GPU capacity per day with lognormal volume, and may move between sites; those arriving in the same 3-h window with the same deadline are modeled as one job. Each short job is due 6, 12 or 24 h after arrival, with assumed probabilities 0.2, 0.3 and 0.5, within the 24-h window. Online

Uncoord.Price-blindSiteFleet
Energy cost ($M) | 65.32 | 62.87 | 61.36 | 61.24
Saving vs. uncoord. (%)–3.766.076.25
Energy (GWh)1,676.11,597.61,617.61,617.6
Avg. price ($/MWh) | 38.97 | 39.35 | 37.93 | 37.86
Mean daily peak (MW)229.2192.0216.2216.4

Table III. Totals and averages of energy and cost in 2025.

inference follows a diurnal shape with an assumed peak-to-trough ratio of 1.6 for the fleet’s mix of services. Average GPU allocation is about 75%.

The workload is taken as known a day ahead. Each day is simulated from a fresh state with an independent workload draw, and training runs enter at a random point in their run. Every day of 2025 (365 days) is simulated in all four modes. Models are built in Pyomo and solved with HiGHS.

Simulation Results

Efficiency, Price Response and Routing

Table III summarizes the year. All modes complete the same 835 million GPU-hours of deferrable work, serve all inference demand and finish every short job by its deadline, so the comparison is at equal output. Fleet coordination cuts energy cost by 6.3%, or about $4.1M per year and $2.5/MWh consumed. Taking differences between consecutive modes splits this saving into three parts, each in percentage points of the uncoordinated cost; Figure 2(a) shows them by month.

Figure 2. Results over 2025. (a) Monthly fleet saving relative to the uncoordinated mode. (b) Average day: fleet power by mode and DA LMP by site, averaged over all days for each hour; the site-level and fleet curves nearly coincide. (c) April 7: the price-responsive modes fill the negative-price solar hours, and the fleet mode also moves load out of Silicon Valley.

Efficiency: 3.8%. Run at a flat price, the optimizer spreads work across spare GPUs at lower power caps, cutting energy by 4.7% and the mean daily peak by 16%. The gain comes from inference and short jobs. At 46% of TDP, a GPU runs each inference request about 1.2 times slower but draws much less power. For training, the gain is under 1%: its runs already use their full GPU limit, so a lower cap would only slow them.

Price response: 2.3%. Responding to LMPs lowers the average price paid by 3.6% relative to the price-blind schedule, mainly by moving work into the midday hours, when solar output lowers prices (Figure 2(b)). Its value follows the solar season: about 7% in March and April, when midday prices fell below zero on most days, but only about 1% from July to September.

Routing: 0.2%. It exceeds 1% on 23 days. On April 7 (Figure 2(c)), for example, midday DA prices fell below zero in Los Angeles and San Diego but averaged $25/MWh in Silicon Valley. The fleet mode moved about 6 MW of midday load out of Silicon Valley, which was worth 2.1% that day.

Conclusion and Future Work

This paper developed a modelling and simulation framework that links an AI data-center fleet’s GPU power caps, job timing and job placement to site power and locational prices. Formulated as a linear program, it remains tractable at fleet scale, and nested scenarios that release one degree of freedom at a time separate efficiency from price-responsive flexibility.

On 2025 CAISO day-ahead prices, coordinated scheduling lowers energy cost by 6.3% at equal work: 3.8% from price-independent power-cap efficiency, 2.3% from temporal shifting and 0.2% from spatial routing. Routing gains little within one ISO, where nodal prices are strongly correlated, but should be worth more across sites with larger price differences, such as congested nodes or different ISOs.

Ongoing work will add real-time operation, re-solving the LP every 15 min by model-predictive control on CAISO’s fifteen-minute market prices, accounting for prediction errors and uncertainties. Future work will use the model to schedule and value grid services such as demand response, voltage and frequency regulation, and couple it with the network through congestion-aware allocation and AC optimal power flow.

Acknowledgment

This work was authored in part by the National Laboratory of the Rockies for the U.S. Department of Energy (DOE) under Contract No. DE-AC36-08GO28308. Funding provided by the Advanced Modeling Grid Research Program at the Office of Electricity, U.S. Department of Energy. The views expressed in the article do not necessarily represent the views of the DOE or the U.S. Government. The U.S. Government retains and the publisher, by accepting the article for publication, acknowledges that the U.S. Government retains a nonexclusive, paid-up, irrevocable, worldwide license to publish or reproduce the published form of this work, or allow others to do so, for U.S. Government purposes.

The authors used Anthropic’s Claude Opus 5.5 to revise some text in the paper. All AI-assisted content was reviewed, edited, and verified by the authors, who take full responsibility for the paper.

References

  1. [1]S. J. Smith, A. Hubbard, A. Newkirk, M. Ganeshalingam, B. Holecek, D. Sartor, M. Mills, and A. Shehabi, “United States Data Center Energy Usage Report: 2025 Update,” Lawrence Berkeley National Laboratory, Tech. Rep. LBNL-2001758, Jun. 2026. [Online]. Available: https://escholarship.org/uc/item/33m6w3x0
  2. [2]T. H. Norris, T. Profeta, D. Patino-Echeverri, and A. Cowie-Haskell, “Rethinking load growth: Assessing the potential for integration of large flexible loads in US power systems,” Nicholas Institute for Energy, Environment & Sustainability, Duke University, Tech. Rep. NI R 25-01, Feb. 2025. [Online]. Available: https://nicholasinstitute.duke.edu/publications/rethinking-load-growth
  3. [3]P. Colangelo, A. K. Coskun, J. Megrue, C. Roberts, S. Sengupta, V. Sivaram, E. Tiao, A. Vijaykar, C. Williams, D. C. Wilson, Z. Mac-Farland, D. Dreiling, N. Morey, A. Ratnayake, and B. Vairamohan, “Turning AI data centers into grid-interactive assets: Results from a field demonstration in Phoenix, Arizona,” arXiv preprint arXiv:2507.00909, 2025.arxiv.org/abs/2507.00909
  4. [4]National Grid, “UK-first trial of AI grid technology successfully demonstrates ability of data centres to adjust power needs.” Press release, with Emerald AI, EPRI, Nebius and NVIDIA, Mar. 2026.
  5. [5]A. Radovanović, R. Koningstein, I. Schneider, B. Chen, A. Duarte, B. Roy, D. Xiao, M. Haridasan, P. Hung, N. Care, S. Talukdar, E. Mullen, K. Smith, M. Cottman, and W. Cirne, “Carbon-aware computing for datacenters,” IEEE Transactions on Power Systems, vol. 38, no. 2, pp. 1270–1280, 2023.arxiv.org/abs/2106.11750
  6. [6]Z. Liu, M. Lin, A. Wierman, S. H. Low, and L. H. Andrew, “Greening geographical load balancing,” in Proc. ACM SIGMETRICS, 2011, pp. 233–244.
  7. [7]A. H. Mazumder and Y. Sang, “System-level impacts of flexible data center load scheduling on cost, emissions, and transmission congestion,” arXiv preprint arXiv:2604.23128, 2026.arxiv.org/abs/2604.23128
  8. [8]I. Riepin, T. Brown, and V. Zavala, “Spatio-temporal load shifting for truly clean computing,” Advances in Applied Energy, vol. 17, p. 10002, 2025.
  9. [9]M. Li, “Beyond scalar flexibility: From eligible AI workloads to dependable load relief,” arXiv preprint arXiv:2609.05406, 2026.arxiv.org/abs/2609.05406
  10. [10]P. Patel, E. Choukse, C. Zhang, Í. Goiri, B. Warrier, N. Mahalingam, and R. Bianchini, “Characterizing power management opportunities for LLMs in the cloud,” in Proc. ACM ASPLOS, 2024, pp. 207–222.DOI
  11. [11]J. Stojkovic, C. Zhang, Í. Goiri, J. Torrellas, and E. Choukse, “DynamoLLM: Designing LLM inference clusters for performance and energy efficiency,” in Proc. IEEE HPCA, 2025, pp. 1348–1362.DOI
  12. [12]Google, “Data center efficiency: Power usage effectiveness (PUE),” https://datacenters.google/efficiency/, 2026.
  13. [13]A. Apartsin and Y. Aperstein, “The joule point: An energy-optimal operating point for AI inference,” arXiv preprint: 2609.27926, 2026.
  14. [14]California ISO, “OASIS: Open access same-time information system,” http://oasis.caiso.com, 2025.

Paper details

vlnc:W_wn5fkx4f
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 5

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Claude Opus 5.5 (bare)

View statement
Looking for related papers…
Contents