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

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

M. Drozdowski, Scheduling parallel tasks ? algorithms and complexity , " in Handbook of Scheduling: Algorithms, Models, and Performance Analysis, 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.
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

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
DOI : 10.1109/MCSE.2013.98

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

K. Jansen and H. Zhang, Scheduling malleable tasks with precedence constraints, ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp.86-95, 2005.

O. Beaumont and A. Guermouche, Task Scheduling for Parallel Multifrontal Methods, Parallel Processing International Conference (Euro-Par), pp.758-766, 2007.
DOI : 10.1007/978-3-540-74466-5_80
URL : https://hal.archives-ouvertes.fr/hal-00358626

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

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

P. Amestoy, A. Buttari, I. S. Duff, A. Guermouche, J. L. Excellent et al., Mumps, Encyclopedia of Parallel Computing, D. A. Padua, pp.1232-1238, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00787042

A. Buttari, Fine Granularity Sparse QR Factorization for Multicore Based Systems, International Conference on Applied Parallel and Scientific Computing, pp.226-236, 2012.
DOI : 10.1137/0910005

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

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

R. Schreiber, A New Implementation of Sparse Gaussian Elimination, ACM Transactions on Mathematical Software, vol.8, issue.3, pp.256-276, 1982.
DOI : 10.1145/356004.356006

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

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, 2014.
DOI : 10.1109/ICPP.2014.57
URL : https://hal.archives-ouvertes.fr/hal-01101054

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

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

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

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

S. L. Graham, M. Snir, and C. A. Patterson, Getting up to speed: The future of supercomputing, 2005.