Search arXivSearch

arXiv · 2609.05406

Beyond Scalar Flexibility: From Eligible AI Workloads to Dependable Load Relief

Abstract

Grid studies often represent data-center flexibility as a fixed percentage of load, although no public production trace has shown how much eligible load persists across event durations or co-moves across clusters. We reconstruct 4,439 hourly power observations from a 185-day trace of 155,410 GPUs and derive a workload-semantic flexibility envelope. The fleet's time-averaged Monte Carlo median facility demand is 55.8 MW, while immediate eligible curtailment averages 3.55 MW after retaining allocated-GPU idle power: 12.1% of workload power and 6.35% of median facility power. Under full realization of that eligibility, 95%-available relief falls from 2.51 MW for one hour to 2.32 MW for four hours and 1.95 MW for 24 hours; a common realizable fraction q scales every value exactly by q. A mean-calibrated scalar overstates these quantities by 17%, 25%, and 47%, while a scalar tail-calibrated at four hours understates the one-hour product by 6% and overstates the 24-hour product by 17%; the share that reproduces the surface varies by a factor of 1.6 across durations and reliability levels. Aggregating 13 clusters raises four-hour firmness from 0.38 to 0.66, but cross-cluster covariance limits the gain. The production scheduler exposes almost no additional delay-based capacity: newly deferrable arrivals average 0.008 MW and have zero 95%-available capacity. These results replace an assumed flexibility percentage with duration, reliability, portfolio, and realizability terms that can be written into interconnection and demand-response contracts.

Explore related subjects

Keep this discovery

BibTeXRIS

Meiyi Li. 2026-09-04. Beyond Scalar Flexibility: From Eligible AI Workloads to Dependable Load Relief. https://arxiv.org/abs/2609.05406

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Non-Blocking Fault Current Limiting Control of Half-Bridge MMCs for MTDC Transmission

A key protection requirement in multiterminal HVDC (MTDC) transmission systems is to selectively isolate faulted areas using DC circuit breakers (DCCBs) during DC faults while keeping the rest of the systems in operation. However, in MTDC systems using half-bridge modular multilevel converters (HB-MMCs), the lack of inherent fault current suppression capability in HB-MMCs can cause converter blocking before fault clearance by DCCBs. This work presents an active fault current limiting (AFCL) control strategy for HB-MMCs to mitigate DC fault currents, thus avoiding converter blocking and reducing the breaking capability required of DCCBs. In addition, a systematic approach is proposed to design the AFCL control strategy under converter and network stability constraints. The effectiveness of the proposed strategy is demonstrated through PSCAD on two typical MTDC systems during DC faults.

eess.SY

A Three-phase and Single-phase Compatible Dual-Mode EV On-Board Charger with Integrated Active Power Decoupling

Onboard charger (OBC) is essential part of Electric Vehicle (EV). High-performance EVs are preferring three phase charging to achieve higher power level. However, the ability to charge from a single phase supply is also required. A dualmode OBC for EVs is proposed, which is capable of operating from both three-phase supply and single-phase supply. The single phase charging comes with the requirement of bulky DC link capacitance due to double frequency current in DC link. The proposed topology eliminates this by achieving Active Power Decoupling (APD) using only one additional relay switch and a small capacitor. The proposed topology is verified under different conditions in a detailed simulation, which shows more than an order of magnitude reduction in DC link capacitance during single phase operation.

eess.SY

Joint Network-and-Server Congestion in Multi-Source Traffic Allocation: A Convex Formulation and Price-Based Decentralization (Extended Version)

This paper studies an important rate allocation problem that arises in many networked and distributed systems: steady-state traffic rate allocation from multiple sources to multiple service nodes when both (i) the access-path delay on each source-node route is rate-dependent (capacity-constrained) and convex, and (ii) each service node (also capacity-constrained) experiences a load-dependent queueing delay driven by aggregate load from all sources. We show that the resulting flow-weighted end-to-end delay minimization is a convex program, yielding a global system-optimal solution characterized by KKT conditions that equalize total marginal costs (a path marginal access term plus a node congestion price) across all utilized routes. This condition admits a Wardrop-type interpretation: for each source, all utilized options equalize total marginal cost, while any option with strictly larger total marginal cost receives no flow. Building on this structure, we develop a lightweight distributed pricing-based algorithm in which each service node locally computes and broadcasts a scalar congestion price from its observed aggregate load, while each source updates its traffic split by solving a small separable convex allocation problem under the advertised prices. Numerical illustrations demonstrate convergence of the distributed iteration to the centralized optimum and highlight the trade-offs induced by jointly modeling access and service congestion.

cs.DC