Compact DAG representation and its symbolic scheduling

DOI10.1016/J.JPDC.2004.05.001zbMath1068.68031OpenAlexW2064007126MaRDI QIDQ1886600

Michel Cosnard, Tao Yang, Emmanuel Jeannot

Publication date: 18 November 2004

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2004.05.001

zbMATH Keywords

Automatic parallelizationLinear clusteringParameterized task graphStatic scheduling

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Experimenting task-based runtimes on a legacy computational fluid dynamics code with unstructured meshes

Uses Software

• SUIF

This page was built for publication: Compact DAG representation and its symbolic scheduling