Search arXivSearch

arXiv · 2606.15408

Data Center Life Cycle Co-Design Optimization

Abstract

Liquid cooled supercomputers dissipate tens of megawatts of waste heat through cooling plants organized as parallel subloops that serve coolant distribution units. The number of subloops and the assignment of units to them are design decisions fixed at construction, yet they have not been systematically optimized at this scale. We present a framework that integrates operational energy from a validated control optimizer, embodied carbon and capital cost from a bill of materials, maintenance over the service life, and expected unplanned downtime from a component level reliability model. All 611 ways of partitioning the 25 coolant distribution units of the Frontier supercomputer into two through six subloops are evaluated. When redundancy is not costed, the optimum is two subloops holding 14 and 11 units, at 3,320.7 tonnes of carbon dioxide equivalent and 3,987k dollars over a 7 year horizon, saving 35.7 tonnes and 63k dollars compared to the documented as built configuration of three duty subloops holding 14, 6 and 5 units. The difference is driven by piping rather than by operational energy, and the identity of the optimum is unchanged across 15 sensitivity scenarios and both extremes of physical unit grouping, although its margin narrows under compact grouping. When the N+1 standby train that the plant actually carries is priced, the optimum moves to four or five duty subloops, adjacent to the three the plant runs and far from the unconstrained answer, and the semi-analytical decision rule reproduces this shift across four leadership class systems. Redundancy policy, not cost or carbon, is what sets the subloop count. A conversion of the built plant is shown not to pay back, so the framework is a greenfield design tool.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shrenik Jadhav, Vidhyashree Nagaraju, Zheng Liu. 2026-08-20. Data Center Life Cycle Co-Design Optimization. https://arxiv.org/abs/2606.15408

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

KEEP EXPLORING

Related papers

Ensuring Stability of Non-Minimal Modes in Input-Output Data-Driven Representation

Many recent data-driven control approaches for linear time-invariant systems are based on output trajectory prediction using input-output data matrices. The system dynamics described by this predictor, which we refer to as the input-output data-driven representation, yields non-unique autoregressive with exogenous inputs (ARX) models having possibly unstable non-minimal modes. In this note, we show that the stability of these non-minimal modes is ensured by a certain choice of ARX model, which coincides with the minimum-norm least-squares predictor using the Moore-Penrose inverse of the data matrix. This stability guarantee holds regardless of the underlying system's stability. Moreover, the stability persists under sufficiently small noise in data when a suitably truncated Moore-Penrose inverse is used. Consequently, the ARX model need not be reduced to the true system order in order to avoid unstable additional modes.

eess.SY

Optimization-Based Formation Flight on Libration Point Orbits

A model predictive control (MPC) framework is developed for station-keeping in spacecraft formation flight along libration point orbits. At each control period, the MPC policy solves a multi-vehicle optimal control problem (MVOCP) that tracks a reference trajectory, while enforcing path constraints on the relative motion of the formation. The control policy makes use of a limited set of control nodes consistent with operational constraints that allow only a small number of maneuver opportunities per revolution. To promote recursive feasibility, path constraints are progressively tightened across the prediction horizon. An isoperimetric reformulation of the constraints is used to prevent inter-sample violations. The resulting MVOCP is a nonconvex program, which is solved via sequential convex programming. The proposed approach is evaluated in a high-fidelity ephemeris model under uncertainties for a formation along the near-rectilinear halo orbit (NRHO), and subject to path constraints on inter-spacecraft separation and relative Sun phase angle. The results demonstrate maintenance of a spacecraft formation that satisfies the path constraints with realistic cumulative propellant consumption.

eess.SY

Certificates Synthesis for A Class of Observational Properties in Stochastic Systems: A Unified Approach

In this paper, we investigate the probabilistic formal verification of stochastic dynamical systems over continuous state spaces. Motivated by problems in state estimation and information-flow security, we introduce the notion of observational properties, which characterize the inferences an external observer can draw from system outputs. These properties are formulated as probabilistic hyperproperties based on HyperLTL over finite traces, yielding a unified framework that subsumes several existing notions studied separately in the literature. We reduce the verification problem to reachability analysis over an augmented structure that integrates the system dynamics with an automaton representation of the specification. Building on this construction, we develop stochastic barrier certificates that provide probabilistic guarantees for property satisfaction while avoiding explicit state-space discretization. The effectiveness of the proposed framework is demonstrated through a case study.

eess.SY