Skip to content
Open access

Feature Engineering for Queue Waiting Time Prediction: Temporal and Queue-State Reconstruction on the Theta Supercomputer

Sep 2026 · Applied Sciences · 0 citations · 12 references

TL;DR

A log-based feature engineering approach designed to significantly improve queue waiting time prediction accuracy is proposed in this study, and feature redundancy is eliminated through comparative analysis, and temporal features capturing periodic job submission patterns are generated.

Abstract

Predicting queue waiting time for batch job schedulers in high-performance computing (HPC) systems is a critical research topic aimed at maximizing resource utilization efficiency and enhancing user experience. However, existing prediction approaches heavily rely on static job characteristics provided by users at submission time, exhibiting clear limitations in capturing the dynamic congestion state of the scheduling system. To address these limitations, a log-based feature engineering approach designed to significantly improve queue waiting time prediction accuracy is proposed in this study. Specifically, feature redundancy is eliminated through comparative analysis, and temporal features capturing periodic job submission patterns are generated. Furthermore, global and local (queue-level) waiting and running states at job submission time are reconstructed exclusively from historical job logs, thereby representing dynamic queue congestion in a fine-grained manner. The effectiveness of the proposed framework was validated using a large-scale job log dataset collected from the Theta supercomputer at the Argonne Leadership Computing Facility (ALCF) between 2017 and 2023, where queue waiting time was discretized into nine distinct intervals and formulated as a multi-class classification problem. Finally, an ablation study was conducted to quantitatively evaluate the performance contribution of each engineered feature group, and comparative experiments were carried out across multiple machine learning models, including Naïve Bayes, k-nearest neighbors (KNN), Random Forest, and XGBoost. Among the compared models, Random Forest achieved the best overall performance, with an accuracy of 88.89%, a balanced accuracy of 57.65%, a macro-averaged precision of 67.95%, and a macro-averaged F1-score of 61.71%. Compared with the baseline feature set, the proposed feature engineering strategy improved accuracy, balanced accuracy, and macro F1-score by 3.85, 7.28, and 9.82 percentage points, respectively, and the proposed RF model obtained a balanced accuracy 18 percentage points higher than the best-performing model reported in a comparable reference study on the same dataset, a cross-study difference not directly attributable to the proposed feature engineering alone.

Read PDF

Similar papers

Preprint Aug 2026

A Smallest-Need-First Job Scheduling Framework with Adaptive Optimization of Idle Node Counts for Energy-Efficient HPC Systems

SNF-ICON is presented, an event-driven controller combining smallest-need-first (SNF) gang scheduling, predictive wake timing, and adaptive warm-spare control that 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.

Reza Pulungan, Raka Satya Prasasta, Santana Yuda Pradata et al. · 0 citations
Open access Aug 2026

Kernel-Level Dynamic Priority Scheduling for Containers

A dynamic priority scheduling framework at the kernel level that enhances the CPU allocation to latency-sensitive containers running in Kubernetes environments and reveals a significant improvement in terms of latency reduction, enhanced throughput, efficient utilization of CPU resources, and stable performance of sche...

T. Rajkumar, Nishanth D., P. M et al. · 0 citations
Open access Sep 2026

Machine Learning-Based Runtime Prediction and Energy Optimization for HPC Job Scheduling Using the NREL Eagle Supercomputer Dataset

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.

Renato Quispe-Vargas, Dina Maribel Yana-Yucra, Richar Andre Vilca-Solorzano 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

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