M. R. Garey and D. S. Johnson, Computers and Intractability, a Guide to the Theory of NP-Completeness, 1979.

G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-spaccamela et al., Complexity and Approximation, 1999.
DOI : 10.1007/978-3-642-58412-1
URL : https://hal.archives-ouvertes.fr/hal-00906941

H. Topcuoglu, S. Hariri, and M. Wu, Performance-effective and low-complexity task scheduling for heterogeneous computing, IEEE Transactions on Parallel and Distributed Systems, vol.13, issue.3, pp.260-274, 2002.
DOI : 10.1109/71.993206

D. Hochbaum, Approximation Algorithms for NP-hard Problems, 1997.

L. Epstein and R. Van-stee, Online bin packing with resource augmentation, Discrete Optimization, vol.4, issue.3-4, pp.322-333, 2007.
DOI : 10.1016/j.disopt.2007.09.004

O. Beaumont, H. Larchevêque, and L. Marchal, Non Linear Divisible Loads: There is No Free Lunch, 2013 IEEE 27th International Symposium on Parallel and Distributed Processing, pp.863-873, 2013.
DOI : 10.1109/IPDPS.2013.94
URL : https://hal.archives-ouvertes.fr/hal-00762008

O. Beaumont and L. Marchal, Analysis of dynamic scheduling strategies for matrix multiplication on heterogeneous platforms, Proceedings of the 23rd international symposium on High-performance parallel and distributed computing, HPDC '14, 2014.
DOI : 10.1145/2600212.2600223
URL : https://hal.archives-ouvertes.fr/hal-01090254

T. White, Hadoop: The definitive guide, 2010.

H. Lee, J. P. Robertson, and J. A. Fortes, Generalized Cannon's algorithm for parallel matrix multiplication, Proceedings of the 11th international conference on Supercomputing , ICS '97, pp.44-51, 1997.
DOI : 10.1145/263580.263591

E. Solomonik and J. Demmel, Communication-optimal parallel 2.5 d matrix multiplication and lu factorization algorithms, Euro-Par 2011 Parallel Processing, pp.90-109, 2011.

T. Gautier, X. Besseron, and L. Pigeon, KAAPI, Proceedings of the 2007 international workshop on Parallel symbolic computation, PASCO '07, 2007.
DOI : 10.1145/1278177.1278182
URL : https://hal.archives-ouvertes.fr/hal-00647474

G. Bosilca, A. Bouteiller, A. Danalis, T. Hérault, P. Lemarinier et al., DAGuE: A generic distributed DAG engine for High Performance Computing, Parallel Computing, vol.38, issue.1-2, pp.37-51, 2012.
DOI : 10.1016/j.parco.2011.10.003

R. M. Badia, J. R. Herrero, J. Labarta, J. M. Pérez, E. S. Quintana-ortí et al., Parallelizing dense and banded linear algebra libraries using SMPSs, Concurrency and Computation: Practice and Experience, pp.2438-2456, 2009.
DOI : 10.1002/cpe.1463

]. 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, pp.187-198, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00384363

E. Agullo, C. Augonnet, J. Dongarra, H. Ltaief, R. Namyst et al., A Hybridization Methodology for High-Performance Linear Algebra Software for GPUs, GPU Computing Gems, Jade Edition, pp.473-484, 2011.
DOI : 10.1016/B978-0-12-385963-1.00034-4

E. Agullo, A. Buttari, A. Guermouche, and F. Lopez, Multifrontal QR Factorization for Multicore Architectures over Runtime Systems, Euro- Par, pp.521-532, 2013.
DOI : 10.1007/978-3-642-40047-6_53
URL : https://hal.archives-ouvertes.fr/hal-01220611

J. V. Lima, T. Gautier, N. Maillard, and V. Danjean, Exploiting Concurrent GPU Operations for Efficient Work Stealing on Multi-GPUs, 2012 IEEE 24th International Symposium on Computer Architecture and High Performance Computing, pp.75-82, 2012.
DOI : 10.1109/SBAC-PAD.2012.28
URL : https://hal.archives-ouvertes.fr/hal-00735470

J. Bueno, J. Planas, A. Duran, R. Badia, X. Martorell et al., Productive Programming of GPU Clusters with OmpSs, 2012 IEEE 26th International Parallel and Distributed Processing Symposium, pp.557-568, 2012.
DOI : 10.1109/IPDPS.2012.58

W. Cirne, F. Brasileiro, D. Paranhos, L. F. Góes, and W. Voorsluys, On the efficacy, efficiency and emergent behavior of task replication in large distributed systems, Parallel Computing, vol.33, issue.3, pp.213-234, 2007.
DOI : 10.1016/j.parco.2007.01.002

A. Oprescu, T. Kielmann, and H. Leahu, Stochastic Tail-Phase Optimization for Bag-of-Tasks Execution in Clouds, 2012 IEEE Fifth International Conference on Utility and Cloud Computing, 2012.
DOI : 10.1109/UCC.2012.23

C. Boeres, A. Lima, and V. Rebello, Hybrid task scheduling: integrating static and dynamic heuristics, Proceedings. 15th Symposium on Computer Architecture and High Performance Computing, pp.199-206, 2003.
DOI : 10.1109/CAHPC.2003.1250339

J. V. Lima, T. Gautier, V. Danjean, B. Raffin, and N. Maillard, Design and analysis of scheduling strategies for multi-CPU and multi-GPU architectures, Parallel Computing, vol.44, pp.37-52, 2015.
DOI : 10.1016/j.parco.2015.03.001
URL : https://hal.archives-ouvertes.fr/hal-01132037

G. Ballard, J. Demmel, O. Holtz, and O. Schwartz, Minimizing Communication in Numerical Linear Algebra, SIAM Journal on Matrix Analysis and Applications, vol.32, issue.3, pp.866-901, 2011.
DOI : 10.1137/090769156

O. Beaumont, V. Boudet, F. Rastello, and Y. Robert, Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms, Algorithmica, vol.34, issue.3, pp.217-239, 2002.
DOI : 10.1007/s00453-002-0962-9
URL : https://hal.archives-ouvertes.fr/hal-00807407

H. Nagamochi and Y. Abe, An approximation algorithm for dissecting a rectangle into rectangles with specified areas, Discrete Applied Mathematics, vol.155, issue.4, pp.523-537, 2007.
DOI : 10.1016/j.dam.2006.08.005

A. Fügenschuh, K. Junosza-szaniawski, and Z. Lonc, Exact and approximation algorithms for a soft rectangle packing problem, Optimization, vol.63, issue.11, pp.1637-1663, 2014.
DOI : 10.1109/43.920707

O. Beaumont, L. Eyraud-dubois, A. Guermouche, and T. Lambert, Comparison of Static and Dynamic Resource Allocation Strategies
URL : https://hal.archives-ouvertes.fr/hal-01163936