AUTOMATIC TASK GRAPH GENERATION TECHNIQUES
Michel Cosnard, M. Loi · Parallel Processing Letters · 1995
We present a model of parallel computation, the parameterized task graph, which is a compact, problem size independent, representation of some frequently used directed acyclic task graphs. Techniques automating the construction of such a representation, starting from an annotated sequential program are proposed. We show that many important properties of the task graph such as the computational load of the nodes and the communication volume of the edges can be automatically deduced in a problem size independent way.