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

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

S. Bharathi, A. Chervenak, E. Deelman, G. Mehta, M. H. 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

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

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

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

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

M. Drozdowski, Scheduling parallel tasks ? algorithms and complexity, Handbook of Scheduling. Chapman and Hall, 2004.

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

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

L. Eyraud-dubois, L. Marchal, O. Sinnen, and F. Vivien, Parallel Scheduling of Task Trees with Limited Memory, ACM Transactions on Parallel Computing, vol.2, issue.2, 2014.
DOI : 10.1145/2779052
URL : https://hal.archives-ouvertes.fr/hal-01160118

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

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

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

A. González-escribano, A. J. Van-gemund, and V. Cardeñoso-payo, Mapping unstructured applications into nested parallelism, High Performance Computing for Computational Science -VECPAR 2002, 5th International Conference, pp.407-420, 2002.

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

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

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.1007/s10878-012-9498-3

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.
URL : https://hal.archives-ouvertes.fr/hal-00824514

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, vol.7, issue.10, pp.1010-1026, 2015.
DOI : 10.1002/cpe.3372

K. Jansen and H. Zhang, An approximation algorithm for scheduling malleable tasks under general precedence constraints, Algorithms and Computation, pp.236-245, 2005.
DOI : 10.1145/1159892.1159899

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/s10951-014-0406-9

R. Lepère, D. Trystram, and G. J. Woeginger, APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS, International Journal of Foundations of Computer Science, vol.13, issue.04, pp.613-627, 2002.
DOI : 10.1142/S0129054102001308

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

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

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

M. Mitchell, Creating minimal vertex series parallel graphs from directed acyclic graphs, Australasian Symposium on Information Visualisation, pp.23-24, 2004.

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

R. Openmp-architecture and . Board, OpenMP application program interface , version 4, 2013.

J. Planas, R. M. Badia, E. Ayguadé, and J. Labarta, Hierarchical taskbased programming with StarSs, IJHPCA, vol.23, issue.3, pp.284-299, 2009.

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

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

G. N. Prasanna and B. R. Musicus, The Optimal Control Approach to Generalized Multiprocessor Scheduling, Algorithmica, vol.15, issue.1, pp.17-49, 1996.
DOI : 10.1007/s004539900002

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

A. S. Sbîrlea, K. Agrawal, and V. Sarkar, Elastic Tasks: Unifying Task Parallelism and SPMD Parallelism with an Adaptive Runtime, Euro- Par 2015, pp.491-503, 2015.
DOI : 10.1007/978-3-662-48096-0_38

O. Sinnen, Task Scheduling for Parallel Systems Wiley series on parallel and distributed computing, 2007.

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

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

Q. Wang and K. H. 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 In: The 9th Workshop on Models and Algorithms for Planning and Scheduling Problems, 2009.