A new method to construct task graphs for $\mathcal{H}$-matrix arithmetic is introduced, which uses the information associated with all tasks of standard recursive algorithms, e.g., block index set matrix blocks involved in computation. Task refinement, i.e., replacement by subcomputations, then used proceed hierarchy until containing actual data are reached. This process a natural extension cl...

We present a model of parallel computation, the parameterized task graph, which is a compact, problem size independent, representation of some frequently used directed acylic task graphs. Techniques automating the construction of such a representation, starting from an annotated sequential program are proposed. We show how to represent the computational load for each node and the communication ...