P. R. Amestoy, I. S. Duff, J. Koster, and J. Excellent, A fully asynchronous multifrontal solver using distributed dynamic scheduling, SIAM Journal on Matrix Analysis and Applications, vol.23, issue.1, pp.15-41, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00808293

P. R. Amestoy, I. S. Duff, and J. Excellent, Multifrontal parallel distributed symmetric and unsymmetric solvers, Comput. Methods Appl. Mech. Eng, vol.184, pp.501-520, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00856651

P. R. Amestoy, I. S. Duff, S. Pralet, and C. Vömel, Adapting a parallel sparse direct solver to architectures with clusters of smps, Parallel Computing, vol.29, pp.1645-1668, 2003.

P. R. Amestoy, I. S. Duff, and C. Vömel, Task scheduling in an asynchronous distributed memory multifrontal solver, SIAM Journal on Matrix Analysis and Applications, 2004.

J. Choi, J. Demmel, I. Dhillon, J. Dongarra, S. Ostrouchov et al., ScaLAPACK: A portable linear algebra library for distributed memory computers -design issues and performance, Computer Physics Communications, vol.97, pp.1-15, 1996.

J. J. Dongarra, I. S. Duff, D. C. Sorensen, H. A. Van-der, and . Vorst, Numerical Linear Algebra for High-Performance Computers, 1998.

I. S. Duff, A. M. Erisman, and J. K. Reid, Direct Methods for Sparse Matrices, 1986.

I. S. Duff and J. K. Reid, The multifrontal solution of indefinite sparse symmetric linear systems, ACM Transactions on Mathematical Software, vol.9, pp.302-325, 1983.

I. S. Duff and J. K. Reid, The multifrontal solution of unsymmetric sets of linear systems, SIAM Journal on Scientific and Statistical Computing, vol.5, pp.633-641, 1984.

A. Geist and E. Ng, Task scheduling for parallel sparse Cholesky factorization, Int J. Parallel Programming, vol.18, pp.291-314, 1989.

A. Guermouche and J. Excellent, Coherent load information mechanisms for distributed dynamic scheduling, Also INRIA report RR5178, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00071410

A. Guermouche and J. Excellent, Memory-based scheduling for a parallel multifrontal solver, 18th International Parallel and Distributed Processing Symposium (IPDPS'04), 2004.
URL : https://hal.archives-ouvertes.fr/hal-00807282

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.

G. Karypis and V. Kumar, MeTiS -A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices -Version 4.0. University of Minnesota, 1998.

J. W. Liu, The role of elimination trees in sparse factorization, SIAM Journal on Matrix Analysis and Applications, vol.11, pp.134-172, 1990.

J. W. Liu, The multifrontal method for sparse matrix solution: Theory and Practice, SIAM Review, vol.34, pp.82-109, 1992.

J. W. Liu, E. G. Ng, and W. Peyton, On finding supernodes for sparse matrix computations, SIAM Journal on Matrix Analysis and Applications, vol.14, pp.242-252, 1993.

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.

P. Raghavan, Distributed sparse matrix factorization: QR and Cholesky decompositions, 1991.