TY - GEN
T1 - Merging Parameterized Task Graphs in PaRSEC Through JDF Composition with LLM Assistance
AU - Gu, Zhuowei
AU - Bouteiller, Aurelien
AU - Schuchart, Joseph
AU - Herault, Thomas
AU - Cao, Qinglei
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2026.
PY - 2026
Y1 - 2026
N2 - The Parameterized Task Graph (PTG) interface in the PaRSEC runtime system provides a powerful mechanism to express scalable, parameterized task dependencies for distributed heterogeneous computing. However, as applications become increasingly complex and hierarchical, developers often need to compose or merge multiple JDF (Job Data Flow) descriptions—each representing a subgraph—into a single coherent PTG, a process that is currently manual, error-prone, and difficult to generalize. In this work, we introduce a Python- and AI-assisted tool to automate the merge-to-JDF process in PaRSEC. The tool recursively analyzes two or more JDFs, identifies overlapping dataflows, and merges their task and data definitions into a unified PTG while preserving correctness and dependency semantics. We demonstrate this approach on representative PTG applications, including multi-stage solvers and AI model, like Transformer, showing that the automated merge tool substantially reduces development effort while maintaining runtime efficiency.
AB - The Parameterized Task Graph (PTG) interface in the PaRSEC runtime system provides a powerful mechanism to express scalable, parameterized task dependencies for distributed heterogeneous computing. However, as applications become increasingly complex and hierarchical, developers often need to compose or merge multiple JDF (Job Data Flow) descriptions—each representing a subgraph—into a single coherent PTG, a process that is currently manual, error-prone, and difficult to generalize. In this work, we introduce a Python- and AI-assisted tool to automate the merge-to-JDF process in PaRSEC. The tool recursively analyzes two or more JDFs, identifies overlapping dataflows, and merges their task and data definitions into a unified PTG while preserving correctness and dependency semantics. We demonstrate this approach on representative PTG applications, including multi-stage solvers and AI model, like Transformer, showing that the automated merge tool substantially reduces development effort while maintaining runtime efficiency.
KW - High-performance computing
KW - Parameterized task graph
KW - Task graph composition
KW - Task-based runtime
UR - https://www.scopus.com/pages/publications/105046907663
U2 - 10.1007/978-3-032-27676-6_12
DO - 10.1007/978-3-032-27676-6_12
M3 - Conference contribution
AN - SCOPUS:105046907663
SN - 9783032276759
T3 - Lecture Notes in Computer Science
SP - 138
EP - 150
BT - Asynchronous Many-Task Systems and Applications - 4th International Workshop, WAMTA 2026, Proceedings
A2 - Diehl, Patrick
A2 - Rampp, Markus
A2 - Laure, Erwin
A2 - Schulz, Martin
PB - Springer Science and Business Media Deutschland GmbH
T2 - 4th International Workshop on Asynchronous Many-Task Systems and Applications, WAMTA 2026
Y2 - 16 February 2026 through 18 February 2026
ER -