Predicting Job Turnaround Time in Large-Scale Distributed Computing Environments with Graph Neural Networks

Large-scale research infrastructures increasingly depend on distributed computing platforms to deliver timely data processing and analysis to their scientific communities. In such environments, job turnaround time is a key operational quantity because it affects user-perceived latency, workflow planning, and the efficient use of heterogeneous computing resources across facilities processing millions of jobs per week. Predicting turnaround time is difficult because it depends not only on intrinsic job characteristics but also on dynamic infrastructure conditions such as queue pressure, resource availability, brokerage decisions, and site-specific operating behavior. We study this problem in the Production and Distributed Analysis (PanDA) workload management system, which supports data-intensive scientific computing across grid, cloud, and high-performance computing resources and is used by large scientific collaborations including ATLAS at the Large Hadron Collider and ePIC at the Electron-Ion Collider. We present PanDA-GNN, a graph neural network for job-level turnaround-time prediction that represents jobs together with their local execution context. Using data from five of the most active PanDA computing sites, with approximately 2.1 million training jobs and separate validation and test sets of approximately 0.46 million and 0.40 million jobs, respectively, we show that graph-based context improves predictive performance over strong non-graph baselines. On the held-out test set, PanDA-GNN achieved R 2 = 0.94, MAE = 84.72 minutes, MedAE = 39.62 minutes, RMSE = 163.59 minutes, and MAPE = 20.39%. These results show that graph-based workload modeling is a practical approach for turnaround-time prediction in large-scale research computing infrastructures and, more broadly, illustrate how data-driven methods can support informed scheduling, provisioning, and latency-aware workflow management across shared distributed research computing infrastructures.

Authors

Institutions

Publication Details

Journal
EPJ Research Infrastructures
Published
2026-06-27
DOI
https://doi.org/10.1007/s41781-026-00167-6
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Predicting Job Turnaround Time in Large-Scale Distributed Computing Environments with Graph Neural Networks

Yihui Ren, Tatiana Korchuganova, Kenny Lo, John T. Steele et al.
EPJ Research Infrastructures
Distributed and Parallel Computing Systems
article

Predicting Job Turnaround Time in Large-Scale Distributed Computing Environments with Graph Neural Networks

Yihui Ren, Tatiana Korchuganova, Kenny Lo, John T. Steele, J Kim, Raees Khan, David S. Park, Kuan-Chieh Hsu, Norbert Podhorszki, Adolfy Hoisie, Sairam Sri Vatsavai, Shengyu Feng, J. Boudreau, Fatih Furkan Akman, Sankha Dutta, Tasnuva Chowdhury, Paul Nilsson, Verena Ingrid Martinez Outschoorn, Ozgur O. Kilic, Frédéric Suter, Shinjae Yoo, Alexei Klimentov, Scott Klasky, Yiming Yang, Wei Yang, Tadashi Maeno
article en

Abstract

Large-scale research infrastructures increasingly depend on distributed computing platforms to deliver timely data processing and analysis to their scientific communities. In such environments, job turnaround time is a key operational quantity because it affects user-perceived latency, workflow planning, and the efficient use of heterogeneous computing resources across facilities processing millions of jobs per week. Predicting turnaround time is difficult because it depends not only on intrinsic job characteristics but also on dynamic infrastructure conditions such as queue pressure, resource availability, brokerage decisions, and site-specific operating behavior. We study this problem in the Production and Distributed Analysis (PanDA) workload management system, which supports data-intensive scientific computing across grid, cloud, and high-performance computing resources and is used by large scientific collaborations including ATLAS at the Large Hadron Collider and ePIC at the Electron-Ion Collider. We present PanDA-GNN, a graph neural network for job-level turnaround-time prediction that represents jobs together with their local execution context. Using data from five of the most active PanDA computing sites, with approximately 2.1 million training jobs and separate validation and test sets of approximately 0.46 million and 0.40 million jobs, respectively, we show that graph-based context improves predictive performance over strong non-graph baselines. On the held-out test set, PanDA-GNN achieved R 2 = 0.94, MAE = 84.72 minutes, MedAE = 39.62 minutes, RMSE = 163.59 minutes, and MAPE = 20.39%. These results show that graph-based workload modeling is a practical approach for turnaround-time prediction in large-scale research computing infrastructures and, more broadly, illustrate how data-driven methods can support informed scheduling, provisioning, and latency-aware workflow management across shared distributed research computing infrastructures.

EPJ Research InfrastructuresVol. 10(1)
Oak Ridge National Laboratory (US), University of Pittsburgh (US), Brookhaven National Laboratory (US), University of Massachusetts Amherst (US), SLAC National Accelerator Laboratory (US), Carnegie Mellon University (US)
U.S. Department of Energy, University of Texas at Arlington, Office of Science, Advanced Scientific Computing Research
Industry, innovation and infrastructure
Openalex Percentile: Top 4%
Distributed and Parallel Computing Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.