Extracting synchronization-free slices of operations in perfectly-nested loops

[1]  Yves Robert,et al.  Scheduling and Automatic Parallelization , 2000, Birkhäuser Boston.

[2]  Monica S. Lam,et al.  Maximizing parallelism and minimizing synchronization with affine transforms , 1997, POPL '97.

[3]  Albert Cohen,et al.  Polyhedral Code Generation in the Real World , 2006, CC.

[4]  Monica S. Lam,et al.  Communication optimization and code generation for distributed memory machines , 1993, PLDI '93.

[5]  William Pugh,et al.  Constraint-based array dependence analysis , 1998, TOPL.

[6]  William Pugh,et al.  Minimizing communication while preserving parallelism , 1996, ICS '96.

[7]  William Pugh,et al.  Iteration space slicing and its application to communication optimization , 1997, ICS '97.

[8]  Monica S. Lam,et al.  Communication-Free Parallelization via Affine Transformations , 1994, LCPC.

[9]  Pierluigi San Pietro,et al.  Extracting Coarse-Grained Parallelism in Program Loops with the Slicing Framework , 2007, Sixth International Symposium on Parallel and Distributed Computing (ISPDC'07).

[10]  Paul Feautrier.  Toward Automatic Distribution , 1994, Parallel Process. Lett..

[11]  Sanjay V. Rajopadhye,et al.  Generation of Efficient Nested Loops from Polyhedra , 2000, International Journal of Parallel Programming.

[12]  Paul Feautrier,et al.  Some efficient solutions to the affine scheduling problem. I. One-dimensional time , 1992, International Journal of Parallel Programming.

[13]  Ken Kennedy,et al.  Optimizing Compilers for Modern Architectures: A Dependence-based Approach , 2001 .

[14]  Albert Cohen,et al.  A Polyhedral Approach to Ease the Composition of Program Transformations , 2004, Euro-Par.

[15]  Albert Cohen,et al.  Putting Polyhedral Loop Transformations to Work , 2003, LCPC.

[16]  Michael E. Wolf,et al.  Improving locality and parallelism in nested loops , 1992 .