Skip to main navigation Skip to search Skip to main content

Merging Parameterized Task Graphs in PaRSEC Through JDF Composition with LLM Assistance

  • Saint Louis University
  • Institut national de recherche en informatique et en automatique
  • Advanced Micro Devices

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationAsynchronous Many-Task Systems and Applications - 4th International Workshop, WAMTA 2026, Proceedings
EditorsPatrick Diehl, Markus Rampp, Erwin Laure, Martin Schulz
PublisherSpringer Science and Business Media Deutschland GmbH
Pages138-150
Number of pages13
ISBN (Print)9783032276759
DOIs
StatePublished - 2026
Event4th International Workshop on Asynchronous Many-Task Systems and Applications, WAMTA 2026 - Hybrid, Garching, Germany
Duration: Feb 16 2026Feb 18 2026

Publication series

NameLecture Notes in Computer Science
Volume16592 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Workshop on Asynchronous Many-Task Systems and Applications, WAMTA 2026
Country/TerritoryGermany
CityHybrid, Garching
Period02/16/2602/18/26

Keywords

  • High-performance computing
  • Parameterized task graph
  • Task graph composition
  • Task-based runtime

Fingerprint

Dive into the research topics of 'Merging Parameterized Task Graphs in PaRSEC Through JDF Composition with LLM Assistance'. Together they form a unique fingerprint.

Cite this