Automatic Data-Flow Graph Generation of MPI Programs ∗

The Data-Flow Graph (DFG) of a parallel application is frequently used to take scheduling decisions, based on the information that it models (dependencies among the tasks and volume of exchanged data). In the case of MPI-based programs, the DFG may be built at run-time by overload-ing the data exchange primitives. This article presents a li-brary that enables the generation of the DFG of a MPI pro-gram, and its use to analyze the network contention on a test-application: the Linpack benchmark. It is the first step towards automatic mapping of a MPI program on a dis-tributed architecture. 1