K. Jansen and C. Urbach, tmLQCD: A program suite to simulate Wilson twisted mass lattice QCD, Computer Physics Communications, vol.180, issue.12, pp.2717-2738, 2009.
DOI : 10.1016/j.cpc.2009.05.016

C. Bonati, M. D. Elia, M. Mariti, F. Negro, and F. Sanfilippo, Equation of state and magnetic susceptibility of N f = 2 + 1 QCD with physical quark masses. arXiv:1310
URL : https://hal.archives-ouvertes.fr/hal-00879639

P. Feautrier, Some efficient solutions to the affine scheduling problem. I. One-dimensional time, International Journal of Parallel Programming, vol.40, issue.6, pp.313-347, 1992.
DOI : 10.1007/BF01407835

P. Fautrier, Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time, International Journal of Parallel Programming, vol.2, issue.4, p.389420, 1992.
DOI : 10.1007/BF01379404

C. Mauras, P. Quinton, S. Rajopadhye, and Y. Saouter, Scheduling affine parameterized recurrences by means of variable dependent timing functions, Proceedings of the International Conference on Application Specific Array Processing, pp.100-110, 1990.
URL : https://hal.archives-ouvertes.fr/inria-00075354

F. Quiller, S. , and R. , Optimizing memory usage in the polyhedral model, ACM Transactions on Programming Languages and Systems (TOPLAS), vol.22, issue.5, pp.773-815, 2000.

A. Größlinger, Precise Management of Scratchpad Memories for Localising Array Accesses in Scientific Codes, Compiler Construction, pp.236-250, 2009.
DOI : 10.1007/978-3-642-00722-4_17

C. Lattner and V. Adve, LLVM: A compilation framework for lifelong program analysis & transformation, International Symposium on Code Generation and Optimization, 2004. CGO 2004., pp.75-86, 2004.
DOI : 10.1109/CGO.2004.1281665

C. Lattner, Clang: A C Language Family Frontend for LLVM

T. Grosser, A. Größlinger, and C. Lengauer, POLLY ??? PERFORMING POLYHEDRAL OPTIMIZATIONS ON A LOW-LEVEL INTERMEDIATE REPRESENTATION, Parallel Processing Letters, vol.22, issue.04, 2012.
DOI : 10.1142/S0129626412500107

S. Verdoolaege, isl: An Integer Set Library for the Polyhedral Model, Mathematical SoftwareICMS 2010, pp.299-302, 2010.
DOI : 10.1007/978-3-642-15582-6_49

K. Kennedy, C. Koelbel, and H. Zima, The rise and fall of High Performance Fortran, Proceedings of the third ACM SIGPLAN conference on History of programming languages , HOPL III, p.71722, 2007.
DOI : 10.1145/1238844.1238851

V. Adve and J. Mellor-crummey, Using integer sets for data-parallel program analysis and optimization, ACM SIGPLAN Notices, vol.33, issue.5, pp.186-198, 1998.
DOI : 10.1145/277652.277721

W. Kelly, V. Maslov, W. Pugh, E. Rosser, T. Shpeisman et al., The Omega calculator and library, version 1.1.0. College Park, pp.20742-20760, 1996.

S. P. Amarasinghe and M. S. Lam, Communication optimization and code generation for distributed memory machines, ACM SIGPLAN Notices, vol.28, issue.6, pp.126-138, 1993.
DOI : 10.1145/173262.155102

R. Dathathri, C. Reddy, T. Ramashekar, and U. Bondhugula, Generating efficient data movement code for heterogeneous architectures with distributed-memory, Parallel Architectures and Compilation Techniques (PACT), 2013 22nd International Conference on, pp.375-386, 2013.

U. Bondhugula, Automatic Distributed-Memory Parallelization and Code Generation using the Polyhedral Framework

M. Classen and M. Griebl, Automatic code generation for distributed memory architectures in the polytope model, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, p.7, 2006.
DOI : 10.1109/IPDPS.2006.1639500

T. Yuki and S. Rajopadhye, Memory Allocations for Tiled Uniform Dependence Programs, IMPACT, vol.2013, p.13, 2013.

M. Ravishankar, J. Eisenlohr, L. Pouchet, J. Ramanujam, A. Rountev et al., Code generation for parallel execution of a class of irregular loops on distributed memory systems, 2012 International Conference for High Performance Computing, Networking, Storage and Analysis, p.72, 2012.
DOI : 10.1109/SC.2012.30

L. Snyder, A Programming Guide to ZPL, Scientific and Engineering Computation Series, 1999.

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

U. Bondhugula, A. Hartono, J. Ramanujam, and P. Sadayappan, A practical automatic polyhedral parallelizer and locality optimizer, ACM SIGPLAN Notices, vol.43, issue.6, pp.101-113, 2008.
DOI : 10.1145/1379022.1375595

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