Measures of parallelism at compile time
Patricia Borensztejn, Jesús Labarta, Cristina Barrado · 2002
We analyze the characteristics of the innermost loops in 9 programs of the Perfect benchmark suite, 60 Linpack subroutines and a subset of the BLAS subroutines. We have generated their dependence graphs and have evaluated at compile time the inherent parallelism of these graphs. The evaluation of the usefulness of some parallelizing techniques has been predicted by modeling the technique over the dependence graph and evaluating the parallelism after the transformation.>