Abstract
This paper addresses the problem of communication-free partitioning of iteration spaces and data spaces along hyperplanes. We consider statement-level partitioning for the iteration spaces. The technique explicitly formulates array references as transformations from statement-iteration spaces to data spaces. Based on these transformations, the necessary and sufficient conditions for the feasibility of communication-free hyperplane partitions are presented.