C. Augonnet, S. Thibault, R. Namyst, and P. Wacrenier, Starpu: a unified platform for task scheduling on heterogeneous multicore architectures, Concurrency and Computation: Practice and Experience, vol.23, issue.2, pp.187-198, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00384363

U. Bondhugula, A. Hartono, J. Ramanujam, and P. Sadayappan, A practical automatic polyhedral parallelizer and locality optimizer, Proceedings of the ACM SIGPLAN 2008 Conference on Programming Language Design and Implementation, pp.101-113, 2008.

P. Clauss, Counting solutions to linear and nonlinear constraints through ehrhart polynomials: Applications to analyze and transform scientific programs, Proceedings of the 10th international conference on Supercomputing, pp.278-285, 1996.
URL : https://hal.archives-ouvertes.fr/hal-01100296

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

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

P. Feautrier, Some efficient solutions to the affine scheduling problem, part II: Multidimensional time, International Journal of Parallel Programming, vol.21, issue.6, pp.389-420, 1992.

P. Feautrier and C. Lengauer, Polyhedron model, Encyclopedia of Parallel Computing, pp.1581-1592, 2011.

F. Quilleré, S. Rajopadhye, and D. Wilde, Generation of efficient nested loops from polyhedra. International journal of parallel programming, vol.28, pp.469-498, 2000.