Static domain analysis for compiling commutative loop nests
Marc Le Fur, Jean-Louis Pazat, Françoise André, 35 - Rennes (France). Inst. de Recherche en Informatique et Systemes Aleatoires (IRISA) Centre National de la Recherche Scientifique (CNRS), 35 (France). Inst . de Recherche en Informatique et Systemes Aleatoires (IRISA) Institut National des Sciences Appliquees de Rennes (INSA), 35 (France). Inst. de Recherche en Informatique et Systemes Aleatoires (IRISA) Rennes-1 Univ., 35 - Rennes (France). Inst. de Recherche en= Informatique et Systemes Aleatoires (IRISA) Institut National de Recherche en Informatique et en Automatique (INRIA) · OpenGrey (Institut de l'Information Scientifique et Technique) · 1993
In the field of scientific computation, many users wish to use the sequential programming model, even though they aim to execute their program on a Distributed Memory Parallel Computer (DMPC). To meet this demand, some prototypes of compilers have been designed to "distribute" sequential programs onto DMPCs. In this paper, we present a static domain analysis which leads to the generation of efficient code for these machines. This analysis relies on the enumeration of the points of a polyhedron which is based on linear and integer programming.