M. Graphics, Catapult-c synthesis

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

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

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

K. Muthukumar and G. Doshi, Software Pipelining of Nested Loops, Proceedings of the 10th International Conference on Compiler Construction, ser. CC '01, pp.165-181, 2001.
DOI : 10.1007/3-540-45306-7_12

H. Rong, Z. Tang, R. Govindarajan, A. Douillet, and G. R. Gao, Single-dimension software pipelining for multidimensional loops, ACM Transactions on Architecture and Code Optimization, vol.4, issue.1, 2007.
DOI : 10.1145/1216544.1216550

S. Derrien, S. Rajopadhye, and S. Kolay, Combined instruction and loop parallelism in array synthesis for FPGAs, Proceedings of the 14th international symposium on Systems synthesis , ISSS '01, pp.165-170, 2001.
DOI : 10.1145/500001.500039

J. Teich, L. Thiele, and L. Z. Zhang, Partitioning processor arrays under resource constraints, The Journal of VLSI Signal Processing, vol.17, issue.1, pp.5-20, 1997.
DOI : 10.1023/A:1007935215591

M. W. Benabderrahmane, L. Pouchet, A. Cohen, and C. Bastoul, The Polyhedral Model Is More Widely Applicable Than You Think, Compiler Construction, pp.283-303, 2010.
DOI : 10.1007/978-3-642-11970-5_16
URL : https://hal.archives-ouvertes.fr/inria-00551087

J. F. Collard, D. Barthou, and P. Feautrier, Fuzzy array dataflow analysis, Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming, pp.92-101, 1995.

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

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-4981007554627716, 2000.
DOI : 10.1023/A:1007554627716

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, pp.332-341, 1995.
DOI : 10.1109/FMPC.1995.380437
URL : http://www.cs.umd.edu/Library/TRs/CS-TR-3317.1/CS-TR-3317.1.ps.Z

P. Boulet and P. Feautrier, Scanning polyhedra without Do-loops, Proceedings. 1998 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.98EX192), p.4, 1998.
DOI : 10.1109/PACT.1998.727127
URL : https://hal.archives-ouvertes.fr/inria-00564990

A. Guillou, P. Quinton, and T. Risset, Hardware Synthesis for Multi- Dimensional Time, " in ASAP, IEEE Computer Society, pp.40-50, 2003.

A. Turjan, B. Kienhuis, and E. F. Deprettere, Classifying interprocess communication in process network representation of nested-loop programs, ACM Transactions on Embedded Computing Systems, vol.6, issue.2, 2007.
DOI : 10.1145/1234675.1234680

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://www.cs.kuleuven.be/~dtai/publications/files/41970.pdf

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

S. Verdoolaege, Integer Set Library: Manual, 2010.
DOI : 10.1007/978-3-642-15582-6_49

D. Wilde, A LIBRARY FOR DOING POLYHEDRAL OPERATIONS, Parallel Algorithms and Applications, vol.15, issue.3-4, 1993.
DOI : 10.1007/BF02574699
URL : https://hal.archives-ouvertes.fr/inria-00074515

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

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.1145/360827.360844

S. Verdoolaege, Handbook of Signal Processing Systems, Polyhedral process networks, 2004.

C. Zissulescu, B. Kienhuis, and E. F. Deprettere, Increasing Pipelined IP Core Utilization in Process Networks Using Exploration, " in FPL, ser. Lecture Notes in Computer Science, pp.690-699, 2004.

M. S. Lam, Software pipelining, PLDI, pp.318-328, 1988.
DOI : 10.1145/989393.989420

H. Yun, J. Kim, and S. Moon, Time optimal software pipelining of loops with control flows, International Journal of Parallel Programming, vol.31, issue.5, pp.339-3911027387028481, 2003.
DOI : 10.1023/A:1027387028481

C. Akturan and J. M. , CALiBeR: a software pipelining algorithm for clustered embedded VLIW processors, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281), pp.112-118, 2001.
DOI : 10.1109/ICCAD.2001.968606

M. Fellahi and A. Cohen, Software Pipelining in Nested Loops with Prolog-Epilog Merging, " in HiPEAC, ser. Lecture Notes in Computer Science, pp.80-94, 2009.

M. T. O-'keefe and H. G. Dietz, Loop coalescing and scheduling for barrier MIMD architectures, IEEE Transactions on Parallel and Distributed Systems, vol.4, issue.9, pp.1060-1064, 1993.
DOI : 10.1109/71.243531

C. Bastoul and P. Feautrier, ADJUSTING A PROGRAM TRANSFORMATION FOR LEGALITY, Parallel Processing Letters, vol.22, issue.01n02, pp.3-17, 2005.
DOI : 10.1142/S0129626497000401

N. Vasilache, A. Cohen, and L. Pouchet, Automatic Correction of Loop Transformations, 16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007), pp.292-30417, 2007.
DOI : 10.1109/PACT.2007.4336220
URL : https://hal.archives-ouvertes.fr/hal-01257283