E. Agullo, A. Buttari, A. Guermouche, and F. Lopez, Implementing multifrontal sparse solvers for multicore architectures with sequential task ow runtime systems, ACM Trans. Math. Softw, vol.4313, issue.2, p.1
DOI : 10.1145/2898348

C. Augonnet, Scheduling Tasks over Multicore machines enhanced with Accelerators : a Runtime System's Perspective, Thèse de doctorat dirigée par Namyst, 2011.

C. Augonnet, S. Thibault, R. Namyst, and P. Wacrenier, StarPU: a unied platform for task scheduling on heterogeneous multicore architectures. Concurrency and Computation: Practice and Experience, p.187198, 2011.
DOI : 10.1007/978-3-642-03869-3_80
URL : http://hal.inria.fr/docs/00/38/43/63/PDF/AugThiNamWac09Europar.pdf

G. Aupy, C. Brasseur, and L. Marchal, Dynamic memoryaware task-tree scheduling, 2016.
DOI : 10.1109/ipdps.2017.58
URL : https://hal.archives-ouvertes.fr/hal-01390107

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, pp.13-113, 2015.
DOI : 10.1145/321607.321620
URL : https://hal.archives-ouvertes.fr/hal-01160118

W. H. Joseph and . Liu, On the storage requirement in the out-of-core multifrontal method for sparse factorization, ACM Trans. Math. Softw, vol.12, issue.3, p.249264, 1986.

W. H. Joseph and . Liu, An application of generalized tree pebbling to sparse matrix factorization, SIAM Journal on Algebraic Discrete Methods, vol.8, issue.3, pp.375-395, 1987.

M. Sergent, Passage à l'echelle d'un support d'exécution à base de tâches pour l'algèbre linéaire dense, Thèse de doctorat dirigée par Namyst List of Figures, 2016.