SearcharxivSearch

arXiv · 2609.05443

COAST: Congestion-Aware Start-Time Recommendations for Carbon-Aware HPC Jobs

Abstract

High-performance computing (HPC) workloads consume substantial amounts of electricity, and their carbon emissions vary over time with the carbon intensity of grid electricity. However, uncoordinated shifting of carbon-aware HPC jobs toward low-carbon periods can concentrate recommended start times in the same time slots, creating congestion and eroding the resulting carbon benefits. This paper proposes COAST, a congestion-aware start-time recommendation mechanism that coordinates HPC jobs by balancing carbon savings against additional job delay and congestion in recommended start-time slots. COAST formulates each decision batch as an exact potential game, enabling best-response updates to converge to stable start-time recommendations. Under an idealized realization model that assumes each job can start at its recommended time, we conduct trace-driven simulations using public HPC energy data and historical grid carbon-intensity traces. The results show that COAST reduces estimated carbon emissions by 15.4\% with 1.5 hours of additional average start delay. Compared with carbon-greedy start-time recommendations, COAST reduces peak time-slot load by 23.8\% while preserving 93\% of the achievable carbon savings. These results quantify the potential benefits of congestion-aware start-time coordination for flexible, carbon-aware HPC jobs.

Explore related subjects

Keep this discovery

BibTeXRIS

Weibin Feng, Abhishek Dasgupta, Zeynep Duygu Tekler, Sudha Ahuja, Jin Zheng, Xun Jiang. 2026-07-29. COAST: Congestion-Aware Start-Time Recommendations for Carbon-Aware HPC Jobs. https://arxiv.org/abs/2609.05443

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

Self-Geometry: GT-Free and Plug-and-Play Test-Time Adaptation for Geometrically Consistent 3D Vision Foundation Models

Recent Vision Foundation Models (VFMs) predict depth, camera pose, and pointmap in a single forward pass without per-scene optimization, achieving strong generalization. However, enforcing explicit multi-view geometric consistency, e.g., through bundle adjustment, is computationally costly and is thus not imposed during VFM pretraining, so such inconsistency can arise. To address this, implicit self-consistency derived from model outputs (e.g., pointmaps, features), though enforced at test-time in prior work, delivers inherently limited performance gain, especially on scenes where the pretrained VFM is highly inaccurate. In contrast to this implicit signal, we propose Self-Geometry, a plug-and-play test-time adaptation pipeline that directly imposes explicit multi-view geometric constraints using 2D pixel correspondences as pseudo ground-truth. Our proposed Self-Geometry consists of Geometric Disentanglement Optimization, which combines Multi-View Consistency and Epipolar Consistency losses with Gradient Disentanglement to prevent gradient conflict; Frame Angular-Neighbor, a view sampler based on SO(3) geodesic distances for lightly imposing these constraints; and Lightweight TTA, which adapts VFMs via LoRA. Our method achieves consistent improvements in both pose and geometry estimation across six VFMs (VGGT, $π^3$, DA3-Giant/Large/Base/Small) and four benchmarks (7Scenes, ETH3D, ScanNet++, HiRoom).

cs.CV

Peer Oversight in Collective Decision Making

This article introduces peer $k$-oversight, a property of sequential collective decision mechanisms requiring at least $k$ agents to be responsible for every harmful outcome. It is shown that whenever $k$-oversight can be achieved by redistributing control over the decisions in a mechanism, it can be achieved using just $k$ agents. A polynomial-time algorithm is also presented that determines whether such a redistribution exists and, when it does, constructs one. These results establish peer oversight as a tractable design principle for multiagent decision-making systems.

cs.GT