Perfectly nested loop tiling transformations based on the transitive closure of the program dependence graph

Abstract

A novel approach to producing tiled code for perfectly nested loops is presented. It is based on the transitive closure of the program dependence graph. The approach is derived via a combination of the Polyhedral and Iteration Space Slicing frameworks that allows us to enlarge the effectiveness of the tiling transformation. The results of the evaluation of the effectiveness of a presented algorithm and the efficiency of tiled codes produced by means of the algorithm are discussed.