Skip to content
Book Open access

Analyzing HPC Job Wait Times under Resource Scaling Using Historical Workload Data

Jul 2026 · Practice and Experience in Advanced Research Computing · 0 citations · 12 references
Computer Science

TL;DR

This work presents a data-driven framework that leverages historical job traces to estimate the impact of resource modifications on queue performance, and introduces the Weighted Wait-Time Score (WWS), a bounded metric that captures both typical and tail wait-time behavior.

Abstract

Understanding the impact of hardware configuration, infrastructure investments, and operational policies on job wait times in high-performance computing (HPC) systems is a challenging problem primarily due to the lack of effective tools that are built on controlled, real-world observations across different system configurations. In this work, we present a data-driven framework that leverages historical job traces to estimate the impact of resource modifications on queue performance. Using job data collected from multiple HPC systems during periods with no hardware changes, we construct a synthetic scheduler that replays real job submission patterns and resource requests, while using ground-truth runtimes to model execution. This enables controlled, counterfactual evaluation of infrastructure changes without modifying production systems. We perform experiments by scaling system resources, including GPUs and CPU cores. Our results on GPU-based systems show that increasing GPU capacity leads to significant reductions in wait times, while CPU-only scaling provides minimal benefit. To quantify these effects, we introduce the Weighted Wait-Time Score (WWS), a bounded metric that captures both typical and tail wait-time behavior. Our experiments show that informed resource scaling improves WWS (up to 92% relative gain in WWS for low-baseline systems), capturing gains in both typical and tail wait-time behavior under this metric. We further formulate a cost-aware optimization framework to guide resource allocation under budget constraints. Our approach offers a data-driven way to evaluate HPC upgrades and supports future predictive optimization and better resource use. Overall, this work provides (i) a trace-driven framework for evaluating resource scaling effects, (ii) a bounded metric (WWS) for comparing wait-time performance, and (iii) a pathway to optimal user wait time optimization based resource allocation in HPC systems.

Read PDF

Similar papers

Book Open access Aug 2026

Theseus: Runtime-Adaptive GPU Collective Communication with Hot-Swappable Schedules

Current GPU Collective Communication Libraries (CCLs) employ predefined schedules optimized for stable environments. Their supported schedules and selection logic are fixed at communicator initialization, which fails to account for evolving runtime conditions, such as workload characteristics and hardware health status...

Rui Ding, Xiandong Lu, Jiajun Wang et al. · 1 citation
Open access Aug 2026

Benchmarking Python–Rust Integration for High-Performance Computing Tasks

A benchmarking study of Python-Rust interoperability reveals that the Rust enhanced versions systematically execute faster than pure Pythoncode- up to three times faster in some cases.

S. Singh, R.pradeep Raj · 0 citations

On the co-design of runtimes, systems and programming interfaces for HPC

(English) High-performance computing (HPC) platforms are evolving towards increasingly complex architectures: many-core CPUs with multi-level NUMA hierarchies, heterogeneity with multiple classes of accelerators and higher-capacity interconnects. The increasing complexity and variety of resources in these machines make...

David Álvarez Robert · 0 citations
Book Open access Jul 2026

Extending the Life of HPC Systems in Resource Constrained Environments: Mapping Productivity-Energy Trade-offs in Memory-Bound Workloads via DVFS and Core Scaling on Repurposed Hardware

This work examines the impact of limiting active cores on repurposed nodes and introduces deep C-state power-gating, fully saturated workloads, and hardware-level power measurements to address viability in complex applications such as OpenFOAM.

Bryan Johnston, Suné Toerien, Vele Nefale et al. · 0 citations
Preprint Aug 2026

BOOSTEDSOSA: Accelerated Inferencing for Low Variance Stochastic Online Scheduling

BOOSTEDSOSA is introduced, a dual-FPGA ML-assisted Scheduling architecture that integrates a Machine Learning predictor for expected processing times, with a novel temporal-aware training policy, enabling its use in existing HPC systems.

Adam H. Ross, Riccardo Revalor, Aryan Singh et al. · 0 citations

Future Generation Computer Systems

Concord, a novel GPU sharing-enabled workload scheduler that outperforms state-of-the-art schedulers, achieves a 1.68 × reduction in JCT and a 29% improvement in GPU utilization in high-load scenarios.

Xin-Hua Wang, Wei-Wei Lin, Hai-Jie Wu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.