C. Ancourt and F. Irigoin, Scanning polyhedra with DO loops, 3rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp.39-50, 1991.
URL : https://hal.archives-ouvertes.fr/hal-00752774

C. Bastoul, Efficient code generation for automatic parallelization and optimization, Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings., pp.23-30, 2003.
DOI : 10.1109/ISPDC.2003.1267639

C. Bastoul, Code generation in the polyhedral model is easier than you think, Proceedings. 13th International Conference on Parallel Architecture and Compilation Techniques, 2004. PACT 2004., pp.7-16, 2004.
DOI : 10.1109/PACT.2004.1342537
URL : https://hal.archives-ouvertes.fr/hal-00017260

C. Bastoul and P. Feautrier, Improving Data Locality by Chunking, CC'12 Intl. Conf. on Compiler Construction, pp.320-335, 2003.
DOI : 10.1007/3-540-36579-6_23
URL : https://hal.archives-ouvertes.fr/inria-00001055

P. Boulet, A. Darte, G. Silber, and F. Vivien, Loop parallelization algorithms: From parallelism extraction to code generation, Parallel Computing, vol.24, issue.3-4, pp.421-444, 1998.
DOI : 10.1016/S0167-8191(98)00020-9
URL : https://hal.archives-ouvertes.fr/hal-00856896

A. Cohen, S. Girbal, D. Parello, M. Sigler, O. Temam et al., Facilitating the search for compositions of program transformations, Proceedings of the 19th annual international conference on Supercomputing , ICS '05, pp.151-160, 2005.
DOI : 10.1145/1088149.1088169
URL : https://hal.archives-ouvertes.fr/hal-01257296

A. Darte and Y. Robert, Mapping uniform loop nests onto distributed memory architectures, Parallel Computing, vol.20, issue.5, pp.679-710, 1994.
DOI : 10.1016/0167-8191(94)90001-9
URL : https://hal.archives-ouvertes.fr/hal-00857077

P. Feautrier, Dataflow analysis of array and scalar references, International Journal of Parallel Programming, vol.24, issue.4, pp.23-53, 1991.
DOI : 10.1007/BF01407931

P. Feautrier, Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time, International Journal of Parallel Programming, vol.2, issue.4, pp.389-420, 1992.
DOI : 10.1007/BF01379404

B. Franke and M. O. Boyle, A complete compiler approach to auto-parallelizing C programs for multi-DSP systems, IEEE Transactions on Parallel and Distributed Systems, vol.16, issue.3, pp.234-245, 2005.
DOI : 10.1109/TPDS.2005.26

I. Hurbain, C. Ancourt, F. Irigoin, M. Barreteau, J. Mattioli et al., A Case Study of Design Space Exploration for Embedded Multimedia Applications on SoCs, Seventeenth IEEE International Workshop on Rapid System Prototyping (RSP'06), 2005.
DOI : 10.1109/RSP.2006.1

U. Kapasi, S. Rixner, W. Dally, B. Khailany, J. Ho-ahn et al., Programmable stream processors, Computer, vol.36, issue.8, pp.54-62, 2003.
DOI : 10.1109/MC.2003.1220582
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.7599

W. Kelly and W. Pugh, A framework for unifying reordering transformations, 1993.

W. Kelly, W. Pugh, and E. Rosser, Code generation for multiple mappings, Proceedings Frontiers '95. The Fifth Symposium on the Frontiers of Massively Parallel Computation, 1995.
DOI : 10.1109/FMPC.1995.380437

D. Kuck, The Structure of Computers and Computations, 1978.

H. and L. Verge, A note on Chernikova's algorithm, 1992.

C. Lengauer, Loop parallelization in the polytope model, Int. Conf. on Concurrency Theory, pp.398-416, 1993.
DOI : 10.1007/3-540-57208-2_28

W. Li and K. Pingali, A singular loop transformation framework based on non-singular matrices, International Journal of Parallel Programming, vol.16, issue.4, pp.183-205, 1994.
DOI : 10.1007/BF02577874

A. Lim and M. Lam, Maximizing parallelism and minimizing synchronization with affine transforms, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, pp.201-214, 1997.
DOI : 10.1145/263699.263719

R. Müller-pfefferkorn, W. Nagel, and B. Trenkler, Optimizing Cache Access: A Tool for Source-to-Source Transformations and Real-Life Compiler Tests, Euro-Par 2004 Parallel Processing, 10th International Euro-Par Conference, pp.72-81, 2004.
DOI : 10.1007/978-3-540-27866-5_10

W. Pugh, The Omega test: a fast and practical integer programming algorithm for dependence analysis, Proceedings of the 1991 ACM/IEEE conference on Supercomputing , Supercomputing '91, pp.4-13, 1991.
DOI : 10.1145/125826.125848

W. Pugh, Uniform techniques for loop optimization, Proceedings of the 5th international conference on Supercomputing , ICS '91, pp.341-352, 1991.
DOI : 10.1145/109025.109108

F. Quilleré, S. Rajopadhye, and D. Wilde, Generation of efficient nested loops from polyhedra, International Journal of Parallel Programming, vol.28, issue.5, pp.469-498, 2000.
DOI : 10.1023/A:1007554627716

J. Ramanujam, Beyond unimodular transformations, The Journal of Supercomputing, vol.3, issue.5, pp.365-389, 1995.
DOI : 10.1007/BF01206273
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.5188

A. Schrijver, Theory of linear and integer programming, 1986.

M. Wolfe, High performance compilers for parallel computing, 1995.

J. Xue, Automating non-unimodular loop transformations for massive parallelism, Parallel Computing, vol.20, issue.5, pp.711-728, 1994.
DOI : 10.1016/0167-8191(94)90002-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.7037