This work analyzes 7.3 million completed jobs from the NREL Eagle supercomputer and finds that the problem is far worse than previously reported: median time-limit utilization is just 6.7%, with users consuming a median of 10.6 minutes against 4-hour requests.
Abstract
Accurate runtime prediction is essential for efficient HPC job scheduling, yet users chronically overesti- mate their jobs’ requirements. We analyze 7.3 million completed jobs from the NREL Eagle supercomputer and find that the problem is far worse than previously reported: median time-limit utilization is just 6.7%, with users consuming a median of 10.6 minutes against 4-hour requests. We train ensemble models (Ran- dom Forest, Gradient Boosting, HistGradientBoosting) and an MLP neural network enriched with user behavioral features—historical runtimes, utilization habits, submission frequency—and temporal context. Our central finding concerns evaluation methodology: under the random train/test splits common in prior work, Random Forest reaches R2 = 0.602 (MAE = 0.99 h), but under a realistic temporal split (train
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
The results show that random-split evaluation overestimates performance, categorical-native boosting improves temporal generalization, and long-job underestimation remains a scheduler-relevant challenge.
Ashfaq Ali Shafin, Khandaker Mamun Ahmed· 0 citations
A reinforcement learning (RL) recommender VERA is presented that formulates vertical memory scaling as a Markov Decision Process and trains an agent on 3353 real Prometheus traces and demonstrates that an observation-driven RL recommender could outperform retrospective heuristics for dynamic memory scaling.
A robust intelligent computing framework that connects machine learning-based runtime prediction to operational capacity management decisions, specifically addressing the challenge of distribution shift across heterogeneous HPC environments is proposed.
Hongyi Zhou· Poster Volume 0008 The 2026...· 0 citations
Task-based HPC runtimes are typically tuned under a performance-first requirement with the assumption that the fastest configuration requires all available cores. This paper asks whether that assumption holds, and whether high performance can be achieved with fewer resources. We study this question using SWITCHES, a ta...
Hui-Min Zhang, Andreas Diavastos· Workshop Proceedings of the...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.