Pith sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2603.27831 v2 pith:32643JLP submitted 2026-03-29 eess.SY cs.SY

Quantifying and Attributing Power Flexibility from GPU-Heavy Data Centers

classification eess.SY cs.SY
keywords flexibilitycentersdatademandgpu-heavyjobspowercooling
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The growth of GPU-heavy data centers has increased electricity demand and challenged grid stability. This paper investigates how an energy-aware job scheduling algorithm provides flexibility in GPU-heavy data centers. We develop a rolling-horizon optimization framework considering IT power and cooling dynamics with limited future job information. Compared with the first-in first-out baseline, we show that energy-aware scheduling brings latent power flexibility during peak-price periods. This flexibility is created through both thermal and computational mechanisms: cooling shifting can reliably reduce demand for short periods at relatively low incentive (\$30/MWh), and movement of backfilled jobs can often reduce demand at similar prices (\$30-300/MWh). Further reduction is possible through reordering or delaying jobs, but due to lost profits these actions come at higher prices (starting at \$600/MWh, more significantly above \$3000/MWh). Flexibility is achievable without knowing arriving jobs, but much greater flexibility can be achieved with perfect foresight of the future queue.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.