Scheduling in the Z-Polyhedral Model

The polyhedral model is extensively used for analyses and transformations of regular loop programs, one of the most important being automatic parallelization. The model, however, is limited in expressivity and the need for the generalization to more general class of programs has been widely known. Analyses and transformations in the polyhedral model rely on certain closure properties. Recently, these closure properties were extended to programs where variables may be defined over unions of Z-polyhedra which are the intersection of polyhedra and lattices. We present the scheduling analysis for the automatic parallelization of programs in the Z-polyhedral model, and obtain multidimensional schedules through an ILP formulation that minimizes latency. The resultant schedule can then be used to construct a space-time transformation to obtain an equivalent program in the Z-polyhedral model.

• Type: Conference
• Year: 2007
• Where: IPPS
• Authors: Gautam Gupta, DaeGon Kim, Sanjay V. Rajopadhye
• Keywords: Automatic Parallelization, Closure Properties, Distributed And Parallel Computing, IPPS 2007, Polyhedral Model