C. Alias, F. Baray, and A. Darte, Bee+Cl@k: An implementation of latticebased array contraction in the source-to-source translator Rose, egw gonfF on v—nE gu—gesD gompilersD —nd „ools for im˜edded ƒystems @vg„iƒ9HUA, 2007.

C. Alias, A. Darte, and A. Plesco, Optimizing remote accesses for ofoaded kernels: Application to high-level synthesis for FPGA, egw ƒsqhe sntlF gonE feren™e on hesignD eutom—tion —nd „est in iurope @he„i9IQA, 2013.

C. Alias, B. Pasca, and A. Plesco, FPGA-specic synthesis of loopnests with pipeline computational cores. wi™ropro™essors —nd wi™rosystems, p.606619, 2012.

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

C. Bastoul, Ecient code generation for automatic parallelization and optimization, Pnd sntern—tion—l ƒymposium on €—r—llel —nd histri˜uted gomputing @sƒ€hg PHHQAD IQEIR y™to˜er PHHQD vju˜lj—n—D ƒloveni—, p.2330, 2003.

F. Bayat, T. A. Johansen, and A. Jalali, Using hash tables to manage timestorage complexity in point location problem: Application to explicit mpc, p.47571577, 2011.

F. Bayat, T. A. Johansen, and A. Jalali, Flexible piecewise function evaluation methods based on truncated binary search trees and lattice representation in explicit mpc. siii „r—ns—™tions on gontrol ƒystems „e™hnology, p.632640, 2012.

A. Bemporad, M. Morari, V. Dua, and E. N. Pistikopoulos, The explicit linear quadratic regulator for constrained systems, Automatica, vol.38, issue.1, p.20, 2002.
DOI : 10.1016/S0005-1098(01)00174-1

M. Blott, Recongurable future for hpc In righ €erform—n™e gomputing 8 ƒimul—E tion @r€gƒAD PHIT sntern—tion—l gonferen™e on, p.130131, 2016.

U. Bondhugula, A. Hartono, J. Ramanujam, and P. Sadayappan, A practical automatic polyhedral parallelizer and locality optimizer, €ro™eedings of the egw ƒsq€vex PHHV gonferen™e on €rogr—mming v—ngu—ge hesign —nd smplement—tionD „u™sonD eD …ƒeD tune UEIQD PHHV, p.101113, 2008.

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

P. Clauss, Counting solutions to linear and nonlinear constraints through ehrhart polynomials: Applications to analyze and transform scientic programs, €ro™eedings of the IHth intern—tion—l ™onferen™e on ƒuper™omputingD sgƒ IWWTD €hil—delphi—D €eD …ƒeD w—y PSEPVD IWWT, p.278285, 1996.
DOI : 10.1145/2591635.2667172

S. Derrien, A. Turjan, C. Zissulescu, B. Kienhuis, and E. F. Deprettere, Deriving ecient control in process networks with compaan/laura. sntern—tion—l tourn—l of im˜edded ƒystems, p.170180, 2008.

P. Feautrier, Dataow analysis of array and scalar references. sntern—tion—l tourn—l of €—r—llel €rogr—mming, p.2353, 1991.

P. Feautrier, Some ecient solutions to the ane scheduling problem. part ii. multidimensional time. sntern—tion—l journ—l of p—r—llel progr—mming, p.389420, 1992.

P. Feautrier and C. Lengauer, Polyhedron model, in™y™lopedi— of €—r—llel gomputing, p.15811592, 2011.

A. Geist, A. Daniel, and . Reed, A survey of high-performance computing scaling challenges. snE tern—tion—l tourn—l of righ €erform—n™e gomputing eppli™—tions, p.1094342015597083, 2015.

V. Valentin, O. I. Gorokhovik, and . Zorko, Piecewise ane functions and polyhedral sets. yptimiz—tion, p.209221, 1994.

R. L. Herman, Numerical solution of 1d heat equation Applied Analytical Methods, course notes, 2014.

C. Macarena, I. Martínez-rodríguez, P. Baturone, and . Brox, Circuit implementation of piecewise-ane functions based on lattice representation, gir™uit „heory —nd hesign @igg„hAD PHII PHth iurope—n gonferen™e on, p.644647, 2011.

A. Oliveri, A. Oliveri, T. Poggi, and M. Storace, Circuit implementation of piecewise-ane functions based on a binary search tree, gir™uit „heory —nd hesignD PHHWF igg„h PHHWF iurope—n gonferen™e on, p.145148, 2009.

L. Pouchet, Polybench: The polyhedral benchmark suite. …‚vX httpXGGwwwF ™sF u™l—F eduG£ pou™hetGsoftw—reGpoly˜en™hG‘™ited tulyD“, 2012.

J. Tarela and M. Martinez, Region congurations for realizability of lattice piecewiselinear models. w—them—ti™—l —nd gomputer wodelling, pp.11-121727, 1999.

P. Tøndel, T. A. Johansen, and A. Bemporad, Evaluation of piecewise ane control via binary search tree. eutom—ti™—, p.945950, 2003.

V. Valentin and . Gorokhovik, Geometrical and analytical characterizations of piecewise ane mappings. €ro™eedings of snstitute w—them—ti™s @„he x—tion—l e™—demy of ƒ™ien™es of fel—rusA, p.2232, 2007.

C. Wen and X. Ma, Analytical expression of explicit mpc solution via lattice piecewise-ane function. eutom—ti™—, p.910917, 2009.

C. Zhang, D. Wu, J. Sun, G. Sun, G. Luo et al., Energyecient cnn implementation on a deeply pipelined fpga cluster, €ro™eedings of the PHIT sntern—tion—l ƒymposium on vow €ower ile™troni™s —nd hesign, p.326331, 2016.
DOI : 10.1145/2934583.2934644

C. Zissulescu, B. Kienhuis, and E. Deprettere, Expression Synthesis in Process Networks generated by LAURA, 2005 IEEE International Conference on Application-Specific Systems, Architecture Processors (ASAP'05), p.1521, 2005.
DOI : 10.1109/ASAP.2005.34

.. Experimental-results, 16 4.2.1 Comparison with common subexpression factorization 17 4.2.2 Distribution of semantic factorizations

R. Inria, Inovallée 655 avenue de l'Europe Montbonnot 38334 Saint Ismier Cedex Publisher Inria Domaine de Voluceau -Rocquencourt BP 105 -78153 Le Chesnay Cedex inria, pp.249-6399