Statement-Level Communication-Free Partitioning Techniques for Parallelizing Compilers

This paper addresses the problem of communication-free partitioning of iteration spaces and data spces along hperplanes. We consider statement-level partitioning for the iteration spaces. THe technique explicitly formulates array references as transformation, the necessary and sufficient conditions for the feasibility of communication-free hyperplane partitions are presented.