M. Drozdowski, Scheduling parallel tasks ? algorithms and complexity, 2004.

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.
DOI : 10.1002/cpe.1631
URL : https://hal.archives-ouvertes.fr/inria-00384363

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

J. Planas, R. M. Badia, E. Ayguadé, and J. Labarta, Hierarchical Task-Based Programming With StarSs, The International Journal of High Performance Computing Applications, vol.17, issue.1, pp.284-299, 2009.
DOI : 10.1109/5.476078

G. Bosilca, A. Bouteiller, A. Danalis, M. Faverge, T. Herault et al., PaRSEC: Exploiting Heterogeneity to Enhance Scalability, Computing in Science & Engineering, vol.15, issue.6, pp.36-45, 2013.
DOI : 10.1109/MCSE.2013.98

A. Radulescu, C. Nicolescu, A. J. Van-gemund, and P. Jonker, CPR: mixed task and data parallel scheduling for distributed systems, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001, p.39, 2001.
DOI : 10.1109/IPDPS.2001.924977
URL : http://www.ph.tn.tudelft.nl/People/pieter/pdfs/2001/IPDPS-2001.pdf

P. Dutot, T. N-'takpé, F. Suter, and H. Casanova, Scheduling Parallel Task Graphs on (Almost) Homogeneous Multicluster Platforms, IEEE Transactions on Parallel and Distributed Systems, vol.20, issue.7, pp.940-952, 2009.
DOI : 10.1109/TPDS.2009.11
URL : https://hal.archives-ouvertes.fr/inria-00347273

M. Drozdowski and W. Kubiak, Scheduling parallel tasks with sequential heads and tails, Annals of Operations Research, vol.90, issue.0, pp.221-246, 1999.
DOI : 10.1023/A:1018964732122

V. Nagarajan, J. Wolf, A. Balmin, and K. Hildrum, FlowFlex: Malleable Scheduling for Flows of MapReduce Jobs, Middleware 2013, pp.103-122, 2013.
DOI : 10.1007/978-3-642-45065-5_6
URL : https://hal.archives-ouvertes.fr/hal-01480794

A. Hugo, A. Guermouche, P. Wacrenier, and R. Namyst, Composing multiple StarPU applications over heterogeneous machines: A supervised approach, IJHPCA, vol.28, issue.3, pp.285-300, 2014.
DOI : 10.1109/ipdpsw.2013.217
URL : https://hal.archives-ouvertes.fr/hal-00824514

R. Mcnaughton, Scheduling with Deadlines and Loss Functions, Management Science, vol.6, issue.1, pp.1-12, 1959.
DOI : 10.1287/mnsc.6.1.1

J. W. Liu, The Role of Elimination Trees in Sparse Factorization, SIAM Journal on Matrix Analysis and Applications, vol.11, issue.1, pp.134-172, 1990.
DOI : 10.1137/0611010

E. Günther, F. König, and N. Megow, Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width, Journal of Combinatorial Optimization, vol.12, issue.1, pp.164-181, 2014.
DOI : 10.1287/ijoc.12.1.57.11901

M. Drozdowski, Scheduling multiprocessor tasks ??? An overview, European Journal of Operational Research, vol.94, issue.2, pp.215-230, 1996.
DOI : 10.1016/0377-2217(96)00123-3
URL : http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.159.1883&rep=rep1&type=pdf

R. Lepère, D. Trystram, and G. J. Woeginger, Approximation algorithms for scheduling malleable tasks under precedence constraints, IJFCS, vol.13, issue.04, pp.613-627, 2002.

K. Jansen and H. Zhang, An approximation algorithm for scheduling malleable tasks under general precedence constraints, pp.236-245, 2005.
DOI : 10.1007/11602613_25

S. Hunold, One step toward bridging the gap between theory and practice in moldable task scheduling with precedence constraints, Concurrency and Computation: Practice and Experience, pp.1010-1026, 2015.
DOI : 10.1145/944618.944621

K. Makarychev and D. Panigrahi, Precedence-Constrained Scheduling of Malleable Jobs with Preemption, pp.823-834, 2014.
DOI : 10.1007/978-3-662-43948-7_68

L. Fan, F. Zhang, G. Wang, and Z. Liu, An effective approximation algorithm for the Malleable Parallel Task Scheduling problem, Journal of Parallel and Distributed Computing, vol.72, issue.5, pp.693-704, 2012.
DOI : 10.1016/j.jpdc.2012.01.011

G. N. Prasanna and B. R. Musicus, Generalized multiprocessor scheduling and applications to matrix computations, IEEE Transactions on Parallel and Distributed Systems, vol.7, issue.6, pp.650-664, 1996.
DOI : 10.1109/71.506703

A. Guermouche, L. Marchal, B. Simon, and F. Vivien, Scheduling Trees of Malleable Tasks for Sparse Linear Algebra, Proceedings of Euro-Par: Parallel Processing, pp.479-490, 2015.
DOI : 10.1007/978-3-662-48096-0_37
URL : https://hal.archives-ouvertes.fr/hal-01160104

O. Beaumont, N. Bonichon, L. Eyraud-dubois, and L. Marchal, Minimizing Weighted Mean Completion Time for Malleable Tasks Scheduling, 2012 IEEE 26th International Parallel and Distributed Processing Symposium, pp.273-284, 2012.
DOI : 10.1109/IPDPS.2012.34
URL : https://hal.archives-ouvertes.fr/inria-00564056

Q. Wang and K. Cheng, A Heuristic of Scheduling Parallel Tasks and Its Analysis, SIAM Journal on Computing, vol.21, issue.2, pp.281-294, 1992.
DOI : 10.1137/0221021

Y. Zinder and S. Walker, Scheduling flexible multiprocessor tasks on parallel machines, The 9th Workshop on Models and Algorithms for Planning and Scheduling Problems, 2009.

J. T. Havill and W. Mao, Competitive online scheduling of perfectly malleable jobs with setup times, European Journal of Operational Research, vol.187, issue.3, pp.1126-1142, 2008.
DOI : 10.1016/j.ejor.2006.06.064

J. Du and J. Y. Leung, Complexity of Scheduling Parallel Task Systems, SIAM Journal on Discrete Mathematics, vol.2, issue.4, pp.473-487, 1989.
DOI : 10.1137/0402042

N. Kell and J. Havill, Improved upper bounds for online malleable job scheduling, Journal of Scheduling, vol.17, issue.4, pp.393-410, 2015.
DOI : 10.1007/s10878-007-9125-x

V. Vizing, Minimization of the maximum delay in servicing systems with interruption, USSR Computational Mathematics and Mathematical Physics, vol.22, issue.3, pp.227-233, 1982.
DOI : 10.1016/0041-5553(82)90143-4

T. E. Carroll and D. Grosu, Incentive Compatible Online Scheduling of Malleable Parallel Jobs with Individual Deadlines, 2010 39th International Conference on Parallel Processing, pp.516-524, 2010.
DOI : 10.1109/ICPP.2010.60

J. Valdes, R. E. Tarjan, and E. L. Lawler, The Recognition of Series Parallel Digraphs, SIAM Journal on Computing, vol.11, issue.2, pp.298-313, 1982.
DOI : 10.1137/0211023

S. Bharathi, A. Chervenak, E. Deelman, G. Mehta, M. Su et al., Characterization of scientific workflows, 2008 Third Workshop on Workflows in Support of Large-Scale Science, pp.1-10, 2008.
DOI : 10.1109/WORKS.2008.4723958

A. González-escribano, A. J. Van-gemund, and V. Cardeñoso-payo, Mapping unstructured applications into nested parallelism, pp.407-420, 2002.

G. Cordasco, R. D. Chiara, and A. L. Rosenberg, Assessing the Computational Benefits of AREA-Oriented DAG-Scheduling, Proceedings of Euro-Par: Parallel Processing, pp.180-192, 2011.
DOI : 10.1016/j.parco.2009.12.005

O. Sinnen, Task Scheduling for Parallel Systems, ser. Wiley series on parallel and distributed computing, 2007.
DOI : 10.1002/0470121173

E. Agullo, A. Buttari, A. Guermouche, and F. Lopez, Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems, ACM Transactions on Mathematical Software, vol.43, issue.2, p.13, 2016.
DOI : 10.1109/71.993206
URL : https://hal.archives-ouvertes.fr/hal-01333645

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

A. Pothen and C. Sun, A Mapping Algorithm for Parallel Sparse Cholesky Factorization, SIAM Journal on Scientific Computing, vol.14, issue.5, pp.1253-1257, 1993.
DOI : 10.1137/0914074

A. Hugo, A. Guermouche, P. Wacrenier, and R. Namyst, A Runtime Approach to Dynamic Resource Allocation for Sparse Direct Solvers, 2014 43rd International Conference on Parallel Processing, pp.481-490, 2014.
DOI : 10.1109/ICPP.2014.57
URL : https://hal.archives-ouvertes.fr/hal-01101054

R. L. Graham, Bounds for Certain Multiprocessing Anomalies, Bell System Technical Journal, vol.45, issue.9, pp.1563-1581, 1966.
DOI : 10.1002/j.1538-7305.1966.tb01709.x

T. A. Davis, J. R. Gilbert, S. I. Larimore, and E. G. Ng, A column approximate minimum degree ordering algorithm, ACM Transactions on Mathematical Software, vol.30, issue.3, pp.377-380, 2004.
DOI : 10.1145/1024074.1024079
URL : http://www.cise.ufl.edu/submit/files/file_397.pdf

F. Pellegrini and J. Roman, Sparse matrix ordering with Scotch, HPCN-Europe, pp.370-378, 1997.
DOI : 10.1007/BFb0031609

T. A. Davis, Y. Hu, D. E. Dolan, and J. J. Moré, The university of florida sparse matrix collection Benchmarking optimization software with performance profiles, Mathematical Programming, pp.201-213, 2002.