Parameterized tiling: the definition of the boundaries of local loops in partial tiles
The aspects of parameterized tiling in application to algorithms with index domain represented by a convex polyhedron are investigated. The structure of the set of partial tiles is proposed and the formulas to determine this set are constructed. The formula to define the boundaries of local loops in partial tiles is obtained as well. These formulas enable one to minimize the calculation time of local loop boundaries in the implementation of the tiling in sequential and parallel programs.