J. B. , E. F. Deprettere, and P. Dewilde, A design methodology for xed-size systolic arrays, International Conference o n application Speciic Array Processing, pp.591-602, 1990.

J. Blazewicz, M. Dror, and J. Weglarz, Mathematical programming formulations for machine scheduling : A survey, European Journal of Operational Research, vol.51, pp.283-300, 1991.

P. Boulet, A. Darte, T. Risset, and Y. Robert, Extended version available as, Scalable High Performance Computing Conference, pp.568-576, 1993.

W. H. Chou and S. Y. Kung, Scheduling partitioned algorithms with limited communication supports, Application Speciic Array Processors ASAP 93, pp.53-64, 1993.

. Ph and . Chretienne, Task scheduling over distributed memory machines, Parallel and Distributed Algorithms, pp.165-176, 1989.

A. Darte, Regular partitioning for synthesizing xed-size systolic arrays, TEGRATION, vol.12, pp.293-304, 1991.

A. Darte, Techniques de parall elisations de nids de boucles, 1993.

A. Darte, L. Khachiyan, and Y. Robert, Linear scheduling is nearly optimal, Parallel Processing Letters, vol.1, issue.2, pp.73-81, 1991.
URL : https://hal.archives-ouvertes.fr/hal-00857050

P. Eautrier, Parametric integer programming. RAIRO R echerche Op erationnelle, vol.22, pp.243-268, 1988.

F. Irigoin and R. Triolet, Supernode partitioning, Proc. 15th Annual ACM Symp. Principles of Programming Languages, pp.319-329, 1988.

K. Jainandunsing, Optimal partitioning scheme for wavefront/systolic array p r ocessors, IEEE Symposium on Circuits and Systems, 1986.

S. Y. Kung, VLSI array processors. P r e n tice-Hall, 1988.

B. Jean, M. Lasserre, and . Queyrane, Generic scheduling polyhedra and new mixed-integer formulation for single-machine scheduling, Integer Programming and Combinatorial Optimization, pp.136-149, 1992.

J. A. Martens, Partitioning of parametrized dataaow graphs, 1993.

D. I. Moldovan and J. A. Fortes, Partitioning and mapping algorithms into xedsize systolic arrays, IEEE Transactions on Computers, vol.35, issue.1, pp.1-12, 1986.
DOI : 10.1109/tc.1986.1676652

W. Pugh, The Omega test: a fast and practical integer programming algorithm for dependence analysis, Communications of the ACM, vol.8, pp.102-114, 1992.
DOI : 10.1145/125826.125848
URL : http://www.cs.umd.edu/~pugh/papers/omega.pdf

P. Quinton and Y. Robert, Systolic Algorithms and Architectures, 1989.

J. Ramanujam, Non-unimodular transformations of nested loops, Proc. Supercomputing'92, pp.214-223, 1992.
DOI : 10.1109/superc.1992.236692

J. Ramanujam and P. Sadayappan, Tiling of iteration spaces for multicomputers, Proc. Internal Conference o n P a r allel Processing, pp.179-186, 1990.
DOI : 10.1016/0743-7315(92)90027-k

R. Schreiber and J. J. Dongarra, Automatic blocking of nested loops, RIACS, 1990.

S. Sharma, C. Huang, and P. Yappan, On data dependence analysis for compiling programs on distributed-memory machines, ACM Sigplan Notices, vol.28, issue.1, 1993.
DOI : 10.1145/156668.156676

B. Sinharoy and N. Szymanski, Finding optimum wavefront of parallel computation, Proc. of the Twenty-Sixth Annual Hawaii International Conference on System Sciences, pp.225-234, 1993.
DOI : 10.1109/hicss.1993.284106

L. Thiele, Resource constrained scheduling of uniform algorithms, Application Speciic Array Processors ASAP 93, pp.29-40, 1993.
DOI : 10.1007/bf02120034