M. Drozdowski, Scheduling parallel tasks-algorithms and complexity, Handbook of Scheduling, 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, vol.23, issue.2, pp.187-198, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00384363

T. Gautier, X. Besseron, and L. Pigeon, KAAPI: A thread scheduling runtime system for data flow computations on cluster of multi-processors, in: International Workshop on Parallel Symbolic Computation, pp.15-23, 2007.

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

G. Bosilca, A. Bouteiller, A. Danalis, M. Faverge, T. Herault et al., PaRSEC: Exploiting heterogeneity for enhancing scalability, Computing in Science & Engineering, vol.15, issue.6, pp.36-45, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00930217

A. Ramakrishnan, G. Singh, H. Zhao, E. Deelman, R. Sakellariou et al., Scheduling data-intensiveworkflows onto storage-constrained distributed resources, CCGrid'07, pp.401-409, 2007.

E. Agullo, P. R. Amestoy, A. Buttari, A. Guermouche, J. L'excellent et al., Robust memory-aware mappings for parallel multifrontal factorizations, SIAM J. Scientific Computing, vol.38, issue.3
URL : https://hal.archives-ouvertes.fr/hal-01334113

D. Sbîrlea, Z. Budimli´cbudimli´c, and V. Sarkar, Bounded memory scheduling of dynamic task graphs, Proc. of PACT, pp.343-356, 2014.

L. Marchal, H. Nagy, B. Simon, and F. Vivien, Parallel scheduling of dags under memory constraints, 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp.204-213, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01828312

R. Sethi and J. Ullman, The generation of optimal code for arithmetic expressions, Journal of the ACM, vol.17, issue.4, pp.715-728, 1970.

R. Sethi, Complete register allocation problems, STOC'73, pp.182-195, 1973.

J. R. Gilbert, T. Lengauer, and R. E. Tarjan, The pebbling problem is complete in polynomial space, SIAM J. Comput, vol.9, issue.3

J. W. Liu, An application of generalized tree pebbling to sparse matrix factorization, SIAM J. Alg. Discrete Methods, vol.8, issue.3, pp.375-395, 1987.

C. Lam, T. Rauber, G. Baumgartner, D. Cociorva, and P. Sadayappan, Memory-optimal evaluation of expression trees involving large objects, Computer Languages, Systems & Structures, vol.37, issue.2, pp.63-75, 2011.

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, p.13, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01070356

S. Bharathi and A. Chervenak, Scheduling data-intensive workflows on storage constrained resources, Proc. of the 4th Workshop on Workflows in Support of Large-Scale Science (WORKS'09, 2009.

M. Sergent, D. Goudin, S. Thibault, and O. Aumage, Controlling the memory subscription of distributed applications with a task-based runtime system, Proc. of IPDPS Workshops, pp.318-327, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01284004

Z. Budimli´cbudimli´c, M. Burke, V. Cavé, K. Knobe, G. Lowney et al., Concurrent collections, Scientific Programming, vol.18, issue.3-4, pp.203-217, 2010.

S. Touati, Register Pressure in Instruction Level Parallelism, Theses, Université de Versailles-Saint Quentin en Yvelines, 2002.

M. Jacquelin, L. Marchal, Y. Robert, and B. Uçar, On optimal tree traversals for sparse matrix factorization, Proc. of the Int. Par. & Dist. Processing Symposium (IPDPS), pp.556-567, 2011.
URL : https://hal.archives-ouvertes.fr/ensl-00527462

R. Sethi, Complete register allocation problems, SIAM journal on Computing, vol.4, issue.3, pp.226-248, 1975.

E. L. Lawler, Combinatorial optimization: networks and matroids, Courier Corporation, 2001.

R. M. Karp, Reducibility among combinatorial problems, pp.85-103, 1972.

M. Garey, D. Johnson, and L. Stockmeyer, Some simplified np-complete graph problems, Theoretical Computer Science, vol.1, issue.3, pp.237-267, 1976.

M. Lampis, G. Kaouri, and V. Mitsou, On the algorithmic effectiveness of digraph decompositions and complexity measures, Discrete Optimization, vol.8, issue.1, pp.129-138, 2011.

P. Shor, Minimum s-t cut in weighted directed acyclic graphs with possibly negative weights

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, , 2009.

E. Ciurea and L. Ciupalâ, Sequential and parallel algorithms for minimum flows, Journal of Applied Mathematics and Computing, vol.15, issue.1, pp.53-75, 2004.

A. V. Goldberg and R. E. Tarjan, A new approach to the maximum flow problem, pp.136-146, 1986.

S. Touati, Register saturation in instruction level parallelism, International Journal of Parallel Programming, vol.33, issue.4, pp.393-449, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00130633

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

G. Csardi and T. Nepusz, The igraph software package for complex network research, InterJournal Complex Systems, p.1695, 2006.

F. Suter, Daggen: A synthetic task graph generator

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.27, pp.1010-1026, 2015.

F. Desprez and F. Suter, A bi-criteria algorithm for scheduling parallel task graphs on clusters, pp.243-252, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00533904

R. F. Da, W. Silva, G. Chen, K. Juve, E. Vahi et al., Community resources for enabling research in distributed scientific workflows, vol.1, pp.177-184, 2014.

H. Topcuoglu, S. Hariri, and M. Y. Wu, Performance-effective and lowcomplexity task scheduling for heterogeneous computing, IEEE Trans. Parallel Distributed Systems, vol.13, issue.3, pp.260-274, 2002.