S. Girbal, N. Vasilache, C. Bastoul, A. Cohen, D. Parello et al., Semi-Automatic Composition of Loop Transformations for Deep Parallelism and Memory Hierarchies, International Journal of Parallel Programming, vol.20, issue.1, 2006.
DOI : 10.1007/s10766-006-0012-3

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

L. Pouchet, C. Bastoul, A. Cohen, and J. Cavazos, Iterative optimization in the polyhedral model: Part II, multidimensional time, ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI'08, pp.90-100, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01257273

U. Bondhugula, A. Hartono, J. Ramanujam, and P. Sadayappan, A practical automatic polyhedral program optimization system, ACM SIGPLAN Conference on Programming Language Design and Implementation, 2008.

K. Kennedy and K. Mckinley, Maximizing loop parallelism and improving data locality via loop fusion and distribution, Languages and Compilers for Parallel Computing, pp.301-320, 1993.
DOI : 10.1007/3-540-57659-2_18

R. Allen and K. Kennedy, Optimizing Compilers for Modern Architectures, 2002.

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

P. Feautrier, Parametric integer programming, RAIRO - Operations Research, vol.22, issue.3, pp.243-268, 1988.
DOI : 10.1051/ro/1988220302431

M. Benabderrahmane, L. Pouchet, A. Cohen, and C. Bastoul, The Polyhedral Model Is More Widely Applicable Than You Think, Proceedings of the International Conference on Compiler Construction (ETAPS CC'10), ser, pp.283-303, 2010.
DOI : 10.1007/978-3-642-11970-5_16

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

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

U. Bondhugula, M. Baskaran, S. Krishnamoorthy, J. Ramanujam, A. Rountev et al., Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model, International conference on Compiler Construction (ETAPS CC), 2008.
DOI : 10.1007/978-3-540-78791-4_9

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

L. Pouchet, Iterative optimization in the polyhedral model, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00419974

P. Clauss, Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: applications to analyze and transform scientific programs, Intl. Conf. on Supercomputing, pp.278-285, 1996.
DOI : 10.1145/2591635.2667172

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

P. Feautrier, Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time, The On-Line Encyclopedia of Integer Sequences, pp.389-420, 1992.
DOI : 10.1007/BF01379404

L. Pouchet, C. Bastoul, A. Cohen, and N. Vasilache, Iterative Optimization in the Polyhedral Model: Part I, One-Dimensional Time, International Symposium on Code Generation and Optimization (CGO'07), pp.144-156, 2007.
DOI : 10.1109/CGO.2007.21

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

F. Irigoin and R. Triolet, Supernode partitioning, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '88, pp.319-329, 1988.
DOI : 10.1145/73560.73588

J. Ramanujam and P. Sadayappan, Tiling multidimensional iteration spaces for multicomputers, Journal of Parallel and Distributed Computing, vol.16, issue.2, pp.108-230, 1992.
DOI : 10.1016/0743-7315(92)90027-K

K. Trifunovic, D. Nuzman, A. Cohen, A. Zaks, and I. Rosen, Polyhedral-Model Guided Loop-Nest Auto-Vectorization, 2009 18th International Conference on Parallel Architectures and Compilation Techniques, pp.327-337, 2009.
DOI : 10.1109/PACT.2009.18

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

F. Bodin, T. Kisuki, P. M. Knijnenburg, M. F. O-'boyle, and E. Rohou, Iterative compilation in a non-linear optimisation space, " in W. on Profile and Feedback Directed Compilation Meta optimization: improving compiler heuristics with machine learning, SIGPLAN Not, vol.38, issue.5, pp.77-90, 1998.

F. Agakov, E. Bonilla, J. Cavazos, B. Franke, G. Fursin et al., Using Machine Learning to Focus Iterative Optimization, International Symposium on Code Generation and Optimization (CGO'06), pp.295-305, 2006.
DOI : 10.1109/CGO.2006.37

S. Long and G. Fursin, A heuristic search algorithm based on unified transformation framework, Proc. of the 2005 Intl. Conf. on Parallel Processing Workshops (ICPPW'05)

A. Qasem and K. Kennedy, Profitable loop fusion and tiling using model-driven empirical search, Proceedings of the 20th annual international conference on Supercomputing , ICS '06, pp.249-258, 2006.
DOI : 10.1145/1183401.1183437

F. Franchetti, Y. Voronenko, and M. Püschel, Formal loop merging for signal transforms, Proc. of the 2005 ACM SIGPLAN Conf. on Programming language design and implementation (PLDI'05, pp.315-326, 2005.

Y. Voronenko, F. De-mesmay, and M. Püschel, Computer Generation of General Size Linear Transform Libraries, 2009 International Symposium on Code Generation and Optimization, 2009.
DOI : 10.1109/CGO.2009.33

K. S. Mckinley, S. Carr, and C. Tseng, Improving data locality with loop transformations, ACM Transactions on Programming Languages and Systems, vol.18, issue.4, pp.424-453, 1996.
DOI : 10.1145/233561.233564

N. Megiddo and V. Sarkar, Optimal weighted loop fusion for parallel programs, Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures , SPAA '97, pp.282-291, 1997.
DOI : 10.1145/258492.258520

S. Singhai and K. Mckinley, A Parametrized Loop Fusion Algorithm for Improving Parallelism and Cache Locality, The Computer Journal, vol.40, issue.6, pp.340-355, 1997.
DOI : 10.1093/comjnl/40.6.340

M. Wolf, D. Maydan, and D. Chen, Combining loop transformations considering caches and scheduling, Proceedings of the 29th Annual IEEE/ACM International Symposium on Microarchitecture. MICRO 29, pp.274-286, 1996.
DOI : 10.1109/MICRO.1996.566468

A. Darte, G. Silber, and F. Vivien, Combining Retiming and Scheduling Techniques for Loop Parallelization and Loop Tiling, Parallel Proc. Letters, pp.379-392, 1997.
DOI : 10.1142/S0129626497000383

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

A. Darte, On the complexity of loop fusion, Parallel Computing, pp.149-157, 1999.

A. Darte and G. Huard, Loop shifting for loop parallelization, ENS Lyon, 2000.

M. Griebl, P. Faber, and C. Lengauer, Space???time mapping and tiling: a helpful combination, Concurrency and Computation: Practice and Experience, pp.221-246, 2004.
DOI : 10.1002/cpe.772

W. Kelly, Optimization within a unified transformation framework, 1996.

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

C. Chen, J. Chame, and M. Hall, CHiLL: A framework for composing high-level loop transformations, pp.8-897, 2008.

A. Tiwari, C. Chen, J. Chame, M. Hall, and J. K. Hollingsworth, A scalable autotuning framework for computer optimization, IPDPS'09, 2009.