In this paper, we present a modified Floyd-Warshall algorithm, where the most time-consuming part -calculating transitive closure describing self-dependences for each loop statement -is computed by means of basis dependence distance vectors derived from all vectors describing self-dependences. We demonstrate that the presented approach reduces the transitive closure calculation time for parameterized graphs representing all dependences in the loop in comparison with techniques implemented in the Omega and ISL libraries. This increases the applicability scope of techniques based on transitive closure of dependence graphs. Experimental results for NASA Parallel Benchmarks are discussed.

In this paper, we present a modified Floyd-Warshall algorithm, where the most time-consuming part-calculating transitive closure describing self-dependences for each loop statement-is computed applying basis dependence distance vectors derived from all vectors describing self-dependences. We demonstrate that the presented approach reduces the transitive closure calculation time for parameterized graphs representing all dependences in the loop in comparison with that yielded by means of techniques implemented in the Omega and ISL libraries. This increases the applicability scope of techniques based on transitive closure of dependence graphs and being aimed at building optimizing compilers. Experimental results for NASA Parallel Benchmarks are discussed.

No abstract

No abstract

No abstract