E. Agullo, J. Demmel, J. Dongarra, B. Hadri, J. Kurzak et al., Numerical linear algebra on emerging architectures: The PLASMA and MAGMA projects, Journal of Physics: Conference Series, vol.180, issue.1, p.12037, 2009.
DOI : 10.1088/1742-6596/180/1/012037

I. Ahmad and Y. Kwok, On exploiting task duplication in parallel program scheduling, IEEE Transactions on Parallel and Distributed Systems, vol.9, issue.9, pp.872-892, 1998.
DOI : 10.1109/71.722221

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

T. D. Braun, H. J. Siegel, N. Beck, L. L. Bölöni, M. Maheswaran et al., A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems, Journal of Parallel and Distributed Computing, vol.61, issue.6, pp.61810-837, 2001.
DOI : 10.1006/jpdc.2000.1714

A. Buttari, J. Langou, J. Kurzak, and J. Dongarra, A class of parallel tiled linear algebra algorithms for multicore architectures, Parallel Computing, vol.35, issue.1, 2009.
DOI : 10.1016/j.parco.2008.10.002

T. Davidovi´cdavidovi´c, L. Liberti, N. Maculan, and N. Mladenovi´cmladenovi´c, Towards the optimal solution of the multiprocessor scheduling problem with communication delays, MISTA Proceedings, 2007.

I. T. Foster, M. Fidler, A. Roy, V. Sander, and L. Winkler, End-to-end quality of service for high-end applications, Computer Communications, vol.27, issue.14, pp.1375-1388, 2004.
DOI : 10.1016/j.comcom.2004.02.014

T. Glatard, J. Montagnat, D. Lingrand, and X. Pennec, Flexible and efficient workflow deployement of data-intensive applications on grids with MOTEUR, Int. Journal of High Performance Computing and Applications, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00459130

J. Herrmann, L. Marchal, and Y. Robert, Model and Complexity Results for Tree Traversals on Hybrid Platforms, Euro-Par 2013 -Parallel Processing, 2013.
DOI : 10.1007/978-3-642-40047-6_65

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

M. Horton, S. Tomov, and J. Dongarra, A Class of Hybrid LAPACK Algorithms for Multicore and GPU Architectures, 2011 Symposium on Application Accelerators in High-Performance Computing, pp.150-158, 2011.
DOI : 10.1109/SAAHPC.2011.18

J. W. Liu, On the storage requirement in the out-of-core multifrontal method for sparse factorization, ACM Transactions on Mathematical Software, vol.12, issue.3, pp.249-264, 1986.
DOI : 10.1145/7921.11325

J. W. Liu, An Application of Generalized Tree Pebbling to Sparse Matrix Factorization, SIAM Journal on Algebraic Discrete Methods, vol.8, issue.3, 1987.
DOI : 10.1137/0608031

T. N. Takpé, F. Suter, and H. Casanova, A comparison of scheduling approaches for mixed-parallel applications on heterogeneous platforms, ISPDC, pp.250-257, 2007.

M. A. Palis, J. Liou, and D. S. Wei, Task clustering and scheduling for distributed memory parallel architectures, IEEE Transactions on Parallel and Distributed Systems, vol.7, issue.1, pp.46-55, 1996.
DOI : 10.1109/71.481597

A. Ramakrishnan, G. Singh, H. Zhao, E. Deelman, R. Sakellariou et al., Scheduling dataintensiveworkflows onto storage-constrained distributed resources, CC- GRID'07, 2007.
DOI : 10.1109/ccgrid.2007.101

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.3658

H. Topcuoglu, S. Hariri, and M. Y. 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

S. Venugopalan and O. Sinnen, Optimal Linear Programming Solutions for Multiprocessor Scheduling with Communication Delays, pp.129-138, 2012.
DOI : 10.1007/978-3-642-33078-0_10

R. N°-8461 and R. Centre-grenoble-?-rhône-alpes, 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