  We provide a multilevel approach for analysing performances of parallel
algorithms. The main outcome of such approach is that the algorithm is
described by using a set of operators which are related to each other according
to the problem decomposition. Decomposition level determines the granularity of
the algorithm. A set of block matrices (decomposition and execution) highlights
fundamental characteristics of the algorithm, such as inherent parallelism and
sources of overheads.
