C. Ashcraft, R. G. Grimes, J. G. Lewis, B. W. Peyton, and H. D. Simon, Progress in Sparse Matrix Methods for Large Linear Systems On Vector Supercomputers, International Journal of High Performance Computing Applications, vol.1, issue.4, pp.10-30, 1987.
DOI : 10.1177/109434208700100403

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

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. Buttari, Fine Granularity Sparse QR Factorization for Multicore Based Systems, Int. Conf. on Applied Parallel and Scientific Computing, pp.226-236, 2012.
DOI : 10.1137/0910005

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

I. S. Duff and J. K. Reid, The Multifrontal Solution of Indefinite Sparse Symmetric Linear, ACM Transactions on Mathematical Software, vol.9, issue.3, pp.302-325, 1983.
DOI : 10.1145/356044.356047

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, pp.15-23, 2007.
DOI : 10.1145/1278177.1278182
URL : https://hal.archives-ouvertes.fr/hal-00647474

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

G. Hardy, J. Littlewood, and G. Pólya, Inequalities, chap. 6.14. Cambridge Mathematical Library, 1952.

P. Hénon, P. Ramet, and J. Roman, PaStiX: a high-performance parallel direct solver for sparse symmetric positive definite systems, Parallel Computing, vol.28, issue.2, pp.301-321, 2002.
DOI : 10.1016/S0167-8191(01)00141-7

A. Hugo, A. Guermouche, P. A. 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

K. Jansen and H. Zhang, Scheduling malleable tasks with precedence constraints, In: ACM Symp. on Par. in Algorithms and Architectures, pp.86-95, 2005.

H. Kellerer, R. Mansini, U. Pferschy, and M. G. Speranza, An efficient fully polynomial approximation scheme for the Subset-Sum Problem, Journal of Computer and System Sciences, vol.66, issue.2, pp.349-370, 2003.
DOI : 10.1016/S0022-0000(03)00006-0

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

X. S. Li, An overview of SuperLU, ACM Transactions on Mathematical Software, vol.31, issue.3, pp.302-325, 2005.
DOI : 10.1145/1089014.1089017

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

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