Representing parallel programs with MPI by exploiting a graph-based approach

This paper presents a novel method for the analysis and representation of parallel program with MPI. Parallel programs are mapped onto graph-theoretical problems and are represented by DP*Tgraph, extension of T-graphs, timing graphs, which are similar to flow graphs. These graphs reflect the structure and the timing behavior of the code. The special merit of this new notation is that it uses a concise notation to characterize the static structure of a program and its possible execution paths.Eje: Programación concurrenteRed de Universidades con Carreras en Informática (RedUNCI