The aim of this paper is to present and analyze models for designing p
arallel programs. In the context of some extensions of the most popula
r execution models (precedence graphs, dataflow, PRAM), we describe sc
heduling techniques which take into account the communication delays.
We illustrate all these models by two families of representative prece
dence graphs, namely, grids and complete trees.