mlsanityData to 7 Oct 2026

About the Influence of Workflow Topology on Task Intensity Prediction through Graph Learning

arXiv 2609.39481 ↗First posted 30 Sep 2026cs.DC cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Efficient resource provisioning for large-scale workflows on cloud infrastructures is a critical performance engineering challenge. These workflows are often structured as directed acyclic graphs (DAGs), where under-provisioning can cause critical bottlenecks and over-provisioning leads to unnecessary costs. Accurate, task-level prediction of resource intensity (e.g., CPU load and memory usage) is essential for mitigating these issues. While task-level features are commonly used for prediction, the performance impact of the workflow's overall topological structure is often overlooked or assumed. The central question of our work is: To what extent does what part of the DAG topology influence task-level resource intensity, and what is the most effective way to model this influence? This paper presents a comprehensive benchmark to systematically quantify the impact of graph topology on task intensity prediction. We evaluate and compare a spectrum of modeling approaches. Our findings demonstrate that topology is a critical feature for accurate prediction. Models incorporating important topological information, even through simple handcrafted features, significantly outperform baseline models. We show that graph-native models provide the highest accuracy, achieving low mean absolute errors for both CPU and memory predictions, and can still be combined with simple topological features that they do not learn for better performance.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 8 of its 38 references that are in the map. First posted on arXiv 30 Sep 2026.

Builds on

8 of 38 references.

References · 8

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017Graph Attention Networkscited by 8,854
  3. 2017Inductive Representation Learning on Large Graphscited by 6,284
  4. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  5. 2018How Powerful are Graph Neural Networks?cited by 4,355
  6. 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
  7. 2020On Mean Absolute Error for Deep Neural Network Based Vector-to-Vector Regressioncited by 33
  8. 2022Leveraging Reinforcement Learning for Task Resource Allocation in Scientific Workflowscited by 3

Built on by

Not cited yet.