Task-dependency graph discovery and compile-time optimizations of OpenMP tasks
Mar 2, 2024··
1 min read
Rafael Herrera Guaitero
Abstract
This talk discusses analyses for recovering task-dependency structure from OpenMP programs and using that information to guide optimization and scheduling decisions.
Date
Mar 2, 2024 12:00 AM — 1:00 AM
Event
Location
Edinburgh, Scotland
This presentation reflects the OpenMP task-discovery work developed through the Argonne and LLVM workshop collaboration path.
Authors
Ph.D. Candidate in Electrical and Computer Engineering
I design execution-contract systems that make State, Dependency, and Effect
compiler-visible across compilers, runtime systems, and agentic AI workflows.
My work spans LLVM and MLIR pipelines, OpenMP and event-driven runtimes, and
typed orchestration systems for heterogeneous and distributed execution.