J. Ansel, C. Chan, Y. L. Wong, M. Olszewski, Q. Zhao et al., Petabricks: a language and compiler for algorithmic choice, PLDI '09, pp.38-49, 2009.

V. Aslot, M. J. Domeika, R. Eigenmann, G. Gaertner, W. B. Jones et al., SPEComp: A New Benchmark Suite for Measuring Parallel Computer Performance, WOMPAT '01, 2001.
DOI : 10.1007/3-540-44587-0_1

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

L. S. Blackford, J. Demmel, J. Dongarra, I. Duff, S. Hammarling et al., An updated set of basic linear algebra subprograms (BLAS), ACM Transactions on Mathematical Software, vol.28, issue.2, pp.135-151, 2001.
DOI : 10.1145/567806.567807

R. D. Blumofe and C. E. Leiserson, Scheduling multithreaded computations by work stealing, J. ACM, vol.46, issue.5, 1999.

U. Bondhugula, A. Hartono, J. Ramanujam, and P. Sadayappan, A practical automatic polyhedral parallelizer and locality optimizer, PLDI '08, pp.101-113, 2008.

P. Clauss and V. Loechner, Parametric analysis of polyhedral iteration spaces, Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96, pp.179-194, 1998.
DOI : 10.1109/ASAP.1996.542833

URL : https://hal.archives-ouvertes.fr/inria-00534840

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

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-348, 1992.
DOI : 10.1007/BF01407835

J. Mars and R. Hundt, Scenario Based Optimization: A Framework for Statically Enabling Online Optimizations, 2009 International Symposium on Code Generation and Optimization, pp.169-179, 2009.
DOI : 10.1109/CGO.2009.24

L. Pouchet, C. Bastoul, A. Cohen, and J. Cavazos, Iterative optimization in the polyhedral model: Part II, multidimensional time, PLDI'08, pp.90-100, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01257273

L. Pouchet, C. Bastoul, A. Cohen, and N. Vasilache, Iterative Optimization in the Polyhedral Model: Part I, One-Dimensional Time, International Symposium on Code Generation and Optimization (CGO'07), pp.144-156, 2007.
DOI : 10.1109/CGO.2007.21

URL : https://hal.archives-ouvertes.fr/hal-01257281

J. Ramanujam and P. Sadayappan, Tiling multidimensional iteration spaces for multicomputers, Journal of Parallel and Distributed Computing, vol.16, issue.2, pp.108-120, 1992.
DOI : 10.1016/0743-7315(92)90027-K

N. Thomas, G. Tanase, O. Tkachyshyn, J. Perdue, N. M. Amato et al., A framework for adaptive algorithm selection in STAPL, Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming , PPoPP '05, pp.277-288, 2005.
DOI : 10.1145/1065944.1065981

K. Tian, Y. Jiang, E. Z. Zhang, and X. Shen, An inputcentric paradigm for program dynamic optimizations, OOPSLA '10, pp.125-139, 2010.

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

M. J. Voss and R. Eigemann, High-level adaptive program optimization with ADAPT, PPoPP '01, pp.93-102, 2001.

R. C. Whaley, A. Petitet, and J. Dongarra, Automated empirical optimizations of software and the ATLAS project, Parallel Computing, vol.27, issue.1-2, pp.3-35, 2001.
DOI : 10.1016/S0167-8191(00)00087-9