C. D. Polychronopoulos, Loop coalescing: a compiler transformation for parallel machines University of Illinois at Urbana-Champaign, Center for Supercomputing Research and Development, 1987.

A. M. Ghuloum and A. L. Fisher, Flattening and parallelizing irregular, recurrent loop nests, ACM SIGPLAN Notices, vol.30, issue.8, pp.58-67, 1995.
DOI : 10.1145/209937.209944

. Openmp, OpenMP Application Program Interface Version 4.0, " 2013

D. L. Kreher and D. R. Stinson, Combinatorial algorithms, ACM SIGACT News, vol.30, issue.1, 1999.
DOI : 10.1145/309739.309744

P. Clauss, Counting Solutions to Linear and Nonlinear Constraints Through Ehrhart Polynomials: Applications to Analyze and Transform Scientific Programs, Proceedings of the 10th International Conference on Supercomputing, ser. ICS '96, pp.278-285, 1996.
DOI : 10.1145/237578.237617

URL : https://hal.archives-ouvertes.fr/hal-01100306

P. Clauss and V. Loechner, Parametric analysis of polyhedral iteration spaces, Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96, pp.179-194, 1998.
DOI : 10.1109/ASAP.1996.542833

URL : https://hal.archives-ouvertes.fr/inria-00534840

S. Verdoolaege, R. Seghir, K. Beyls, V. Loechner, and M. Bruynooghe, Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions, Algorithmica, vol.48, issue.1, pp.37-66, 2007.
DOI : 10.1007/s00453-006-1231-0

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

P. Clauss and B. Meister, Automatic memory layout transformations to optimize spatial locality in parameterized loop nests, ACM SIGARCH Computer Architecture News, vol.28, issue.1, pp.11-19, 2000.
DOI : 10.1145/346023.346031

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

S. Verdoolaege, isl: An Integer Set Library for the Polyhedral Model, Proc. of the Third Int. Conf. on Math. Software, ser, pp.299-302, 2010.
DOI : 10.1007/978-3-642-15582-6_49

]. A. Duran, R. Silvera, J. Corbalán, and J. Labarta, Runtime Adjustment of Parallel Nested Loops, Shared Memory Parallel Programming with Open MP: 5th International Workshop on Open MP Applications and Tools, 2004.
DOI : 10.1007/978-3-540-31832-3_12

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

A. Jackson and O. Agathokleous, Dynamic loop parallelisation, 1205.

R. Sakellariou, A compile-time partitioning strategy for nonrectangular loop nests, Proceedings of the 11th International Symposium on Parallel Processing, ser. IPPS '97, pp.633-637, 1997.
DOI : 10.1109/ipps.1997.580968

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

A. Kejariwal, P. Alberto, A. Nicolau, and C. D. Polychronopoulos, A geometric approach for partitioning ndimensional non-rectangular iteration spaces, Proceedings of the 17th International Conference on Languages and Compilers for High Performance Computing, ser. LCPC'04, pp.102-116, 2005.
DOI : 10.1007/11532378_9

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

N. Kafri and J. A. Sbeih, Simple near optimal partitioning approach to perfect triangular iteration space, Proceedings of the 2008 High Performance Computing & Simulation Conference, 2008.