P. R. Amestoy, A. Buttari, I. S. Duff, A. Guermouche, J. Y. L'excellent et al., Encyclopedia of Parallel Computing, pp.1232-1238, 2011.

P. R. Amestoy, I. S. Duff, and J. Y. L'excellent, Multifrontal parallel distributed symmetric and unsymmetric solvers, Computer Methods in Applied Mechanics and Engineering, vol.184, issue.2, pp.501-520, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00856651

O. Beaumont and A. Guermouche, Task scheduling for parallel multifrontal methods, European Conference on Parallel Processing, pp.758-766, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00358626

T. A. Davis, Direct Methods for Sparse Linear Systems, Society for Industrial and Applied Mathematics, 2006.


T. A. Davis and Y. Hu, The University of Florida Sparse Matrix Collection, ACM Trans. Math. Softw, vol.38, issue.1, pp.1-1, 2011.

T. A. Davis and Y. Hu, The University of Florida Sparse Matrix Collection, ACM Trans. Math. Softw, vol.38, issue.1, 2011.


I. S. Duff and J. K. Reid, The multifrontal solution of indefinite sparse symmetric linear, ACM Trans. Math. Softw, vol.9, issue.3, pp.302-325, 1983.

A. George, J. W. Liu, and E. Ng, Communication results for parallel sparse Cholesky factorization on a hypercube, Parallel Computing, vol.10, issue.3, pp.287-298, 1989.

M. T. Heath, E. Ng, and B. W. Peyton, Parallel algorithms for sparse linear systems, SIAM Rev, vol.33, issue.3, pp.420-460, 1991.


P. Hénon, P. Ramet, and J. Roman, PaStiX: A High-Performance Parallel Direct Solver for Sparse Symmetric Definite Systems, Parallel Computing, vol.28, issue.2, pp.301-321, 2002.

M. Jacquelin, Y. Zheng, E. Ng, and K. A. Yelick, An Asynchronous Taskbased Fan-Both Sparse Cholesky Solver, 2016.

X. S. Li and J. W. Demmel, SuperLU DIST: A Scalable Distributed-Memory Sparse Direct Solver for Unsymmetric Linear Systems, ACM Trans. Math. Softw, vol.29, issue.2, pp.110-140, 2003.

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.

G. S. Prasanna and B. R. Musicus, Generalized multiprocessor scheduling and applications to matrix computations, IEEE TPDS, vol.7, issue.6, pp.650-664, 1996.

E. Rothburg and A. Gupta, An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization, Proceedings of the 1993 ACM/IEEE Conference on Supercomputing, pp.503-512, 1993.

, Inria We now prove that the algorithm GreedyMappingInt is also optimal on general trees