Metraipolis › archive › dc_b6a679acb2fb
A Smallest-Need-First Job Scheduling Framework with Adaptive Optimization of Idle Node Counts for Energy-Efficient HPC Systems — arXiv:2608.29656
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.29656
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T08:19:02.470Z
- SHA-256 of the archived text
d0059d4eb2a38563b8029365a7af22645915971d45571a6fee5f97ef832b1f49- Stable URL of this page
https://metraipolis.com/documento/dc_b6a679acb2fb
How to cite
A Smallest-Need-First Job Scheduling Framework with Adaptive Optimization of Idle Node Counts for Energy-Efficient HPC Systems — arXiv:2608.29656 — arXiv (en), https://arxiv.org/abs/2608.29656 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b6a679acb2fb (Metraipolis archive dc_b6a679acb2fb, sha256 d0059d4eb2a38563b8029365a7af22645915971d45571a6fee5f97ef832b1f49)
BibTeX
@misc{dcb6a679acb2fb,
title = {A Smallest-Need-First Job Scheduling Framework with Adaptive Optimization of Idle Node Counts for Energy-Efficient HPC Systems — arXiv:2608.29656},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.29656},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b6a679acb2fb; sha256 d0059d4eb2a38563b8029365a7af22645915971d45571a6fee5f97ef832b1f49},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.29656. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Power-state management in high-performance computing (HPC) clusters must reduce idle energy without excessive wake-up delays for rigid parallel jobs. This paper presents SNF-ICON, an event-driven controller combining smallest-need-first (SNF) gang scheduling, predictive wake timing, and adaptive warm-spare control. At each scheduler invocation, recent interarrival and completed-service samples are screened for sufficiency, exponential-like variability, low lag-one autocorrelation, and acceptable Kolmogorov-Smirnov distance. Rejected or data-sparse windows use SNF+IPM (Intelligent Power Manager), whereas accepted windows activate release prediction and an exponential next-event model. Warm-spare optimization is applied only when queue, event, and arrival-recency conditions permit, balancing estimated waiting and non-compute energy over a timeout-capped horizon. We evaluate four DAS2 trace segments and a generated Markovian workload on AOBA-derived 64-node models, plus SDSC Blue on an AOBA-derived 1152-node model. SNF-ICON is compared with SNF+IPM and First Come First Served (FCFS) + backfilling with IPM. It reduces average waiting time relative to the FCFS-based baseline in all six cases and remains close to at least one heuristic energy baseline in five. The generated workload spends substantial time in ICON mode, whereas DAS2 workloads operate mainly in fallback. Furthermore, cross-platform results show strong dependence on node-transition and power models. Thus, no single policy or parameter set works best in every case. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-01 in cs.DC). Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC). Pagina del lavoro: https://arxiv.org/abs/2608.29656 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T08:07:11.117Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).