C. Alias, B. Pasca, and A. Plesco, FPGA-Specific Synthesis of Loop-Nests with Pipeline Computational Cores, Microprocessors and Microsystems, vol.36, issue.8, pp.606-619, 2012.

C. Alias and A. Plesco, Data-aware Process Networks, vol.32, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01158726

C. Bastoul, A. Cohen, S. Girbal, S. Sharma, and O. Temam, Putting polyhedral loop transformations to work, International Workshop on Languages and Compilers for Parallel Computing, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00071681

D. Bernstein, M. Rodeh, and I. Gertner, On the complexity of scheduling problems for parallel/pipelined machines, IEEE Trans. Comput, vol.38, pp.1308-1313, 1989.

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 (PLDI), 2008.

P. Coussy and A. Morawiec, High-Level Synthesis: From Algorithm to Digital Circuit, 2008.

P. Feautrier, Dataflow analysis of array and scalar references, International Journal of Parallel Programming, vol.20, pp.23-53, 1991.

P. Feautrier, Some Efficient Solutions to the Affine Scheduling Problem, Part II: Multi-Dimensional Time, International Journal of Parallel Programming, vol.21, pp.389-420, 1992.

A. Geist, A. Daniel, and . Reed, A survey of high-performance computing scaling challenges, International Journal of High Performance Computing Applications, p.1094342015597083, 2015.

L. John, T. Hennessy, and . Gross, Postpass code optimization of pipeline constraints, ACM Transactions on Programming Languages and Systems (TOPLAS), vol.5, pp.422-448, 1983.

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.

G. Kahn, The Semantics of Simple Language for Parallel Programming, IFIP Congress 74, pp.471-475, 1974.

C. L. Lawson, R. J. Hanson, D. R. Kincaid, and F. T. Krogh, Basic Linear Algebra Subprograms for Fortran Usage, ACM Trans. Math. Softw, vol.5, pp.308-323, 1979.

S. Meijer, Transformations for Polyhedral Process Networks, 2010.

L. Pouchet, Polybench: The polyhedral benchmark suite, 2012.

E. Rijpkema, E. F. Deprettere, and B. Kienhuis, Deriving process networks from nested loop algorithms, Parallel Processing Letters, vol.10, pp.165-176, 2000.

A. Turjan, Compiling nested loop programs to process networks, 2007.

A. Turjan, B. Kienhuis, and E. D. , Classifying interprocess communication in process network representation of nested-loop programs, ACM Transactions on Embedded Computing Systems (TECS), vol.6, p.13, 2007.

S. Verdoolaege, Polyhedral Process Networks, pp.931-965, 2010.

M. Wolfe, Iteration Space Tiling for Memory Hierarchies, Proceedings of the Third SIAM Conference on Parallel Processing for Scientific Computing, pp.357-361, 1989.