.. Flexible-allocation, 65 3.3.4.1 Classical (non in-place) assembly scheme, p.66

A. Memory-management, 82 3.5.1 In-core stack memory1 Recalling the classical and last-in-place assembly schemes, In-place assembly of the largest contribution block, p.85

.. Out-of-core-stacks, Using information from the analysis: static top-down formulation, p.89

E. Agullo, On the Out-of-core Factorization of Large Sparse Matrices, 2008.
URL : https://hal.archives-ouvertes.fr/tel-00563463

E. Agullo, P. Amestoy, A. Buttari, A. Guermouche, J. Excellent et al., Robust memory-aware mappings for parallel multifrontal factorizations, Feb, SIAM conference on Parallel Processing for Scientific Computing (PP12), 2012.

E. Agullo, A. Guermouche, and J. Excellent, A Preliminary Out-of-Core Extension of a Parallel Multifrontal Solver, EuroPar'06 Parallel Processing, pp.1053-1063, 2006.
DOI : 10.1007/11823285_111

URL : https://hal.archives-ouvertes.fr/hal-00358624

E. Agullo, A. Guermouche, and J. Excellent, On reducing the I/O volume in a sparse out-ofcore solver, HiPC'07 14th International Conference On High Performance Computing, number 4873 in Lecture Notes in Computer Science, pp.47-58, 2007.

E. Agullo, A. Guermouche, and J. Excellent, Reducing the I/O Volume in an Out-of-Core Sparse Multifrontal Solver, Research Report, vol.6207, 2007.
DOI : 10.1007/978-3-540-77220-0_9

URL : https://hal.archives-ouvertes.fr/hal-00358625

E. Agullo, A. Guermouche, and J. Excellent, Towards a parallel out-of-core multifrontal solver: Preliminary study, Research report, vol.6120, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00130278

E. Agullo, A. Guermouche, and J. Excellent, On the I/O Volume in Out-of-Core Multifrontal Methods with a Flexible Allocation Scheme, VECPAR'08 International Meeting on High Performance Computing for Computational Science, pp.328-335, 2008.
DOI : 10.1007/978-3-540-92859-1_29

URL : https://hal.archives-ouvertes.fr/hal-00358627

E. Agullo, A. Guermouche, and J. Excellent, A parallel out-of-core multifrontal method: Storage of factors on disk and analysis of models for an out-of-core active memory, Parallel Computing, vol.34, issue.6-8, pp.6-8296, 2008.
DOI : 10.1016/j.parco.2008.03.007

URL : https://hal.archives-ouvertes.fr/hal-00358621

E. Agullo, A. Guermouche, and J. Excellent, Reducing the I/O Volume in Sparse Out-of-core Multifrontal Methods, SIAM Journal on Scientific Computing, vol.31, issue.6, pp.314774-4794, 2010.
DOI : 10.1137/080720061

A. V. Aho, M. R. Garey, and J. D. Ullman, The Transitive Reduction of a Directed Graph, SIAM Journal on Computing, vol.1, issue.2, pp.131-137, 1972.
DOI : 10.1137/0201008

A. V. Aho, J. E. Hopcroft, and J. D. Ullman, Data Structures and Algorithms, 1983.

P. Amestoy, I. Duff, J. Excellent, F. Rouet, and B. Uçar, Parallel Computation of Entries of ${A}^{-1}$, SIAM Workshop on Combinatorial Scientific Computing (CSC11), pp.2011-2032, 2011.
DOI : 10.1137/120902616

URL : https://hal.archives-ouvertes.fr/hal-00759556

P. R. Amestoy, Factorization of large sparse matrices based on a multifrontal approach in a multiprocessor environment, 1991.

P. R. Amestoy, A. Buttari, and J. Excellent, Towards a parallel analysis phase for a multifrontal sparse solver, Presentation at the 5th International workshop on Parallel Matrix Algorithms and Applications (PMAA'08), 2008.
URL : https://hal.archives-ouvertes.fr/hal-00803488

P. R. Amestoy, T. A. Davis, and I. S. Duff, An Approximate Minimum Degree Ordering Algorithm, SIAM Journal on Matrix Analysis and Applications, vol.17, issue.4, pp.886-905, 1996.
DOI : 10.1137/S0895479894278952

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.8417

P. R. Amestoy and I. S. Duff, Vectorization of a Multiprocessor Multifrontal Code, International Journal of High Performance Computing Applications, vol.3, issue.3, pp.41-59, 1989.
DOI : 10.1177/109434208900300303

P. R. Amestoy and I. S. Duff, Memory Management Issues in Sparse Multifrontal Methods On Multiprocessors, International Journal of High Performance Computing Applications, vol.7, issue.1, pp.64-82, 1993.
DOI : 10.1177/109434209300700105

P. R. Amestoy, I. S. Duff, A. Guermouche, and T. Slavova, Analysis of the out-of-core solution phase of a parallel multifrontal approach, Research report RT, vol.3, 2007.

P. R. Amestoy, I. S. Duff, A. Guermouche, and T. Slavova, Analysis of the solution phase of a parallel multifrontal approach, Parallel Computing, vol.36, issue.1, pp.3-15, 2010.
DOI : 10.1016/j.parco.2009.06.001

URL : https://hal.archives-ouvertes.fr/inria-00413470

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.
DOI : 10.1137/S0895479899358194

URL : https://hal.archives-ouvertes.fr/hal-00808293

P. R. Amestoy, I. S. Duff, and J. Excellent, Multifrontal solvers within the PARASOL environment, Applied Parallel Computing, PARA'98, pp.7-11, 1998.
DOI : 10.1007/BFb0095312

URL : https://hal.archives-ouvertes.fr/hal-00856857

P. R. Amestoy, I. S. Duff, and J. Excellent, MUMPS MUltifrontal Massively Parallel Solver Version 2.0, 1998.
URL : https://hal.archives-ouvertes.fr/hal-00856859

P. R. Amestoy, I. S. Duff, and J. Excellent, Multifrontal parallel distributed symmetric and unsymmetric solvers, Computer Methods in Applied Mechanics and Engineering, vol.184, issue.2-4, pp.501-520, 2000.
DOI : 10.1016/S0045-7825(99)00242-X

URL : https://hal.archives-ouvertes.fr/hal-00856651

P. R. Amestoy, I. S. Duff, J. Excellent, and X. S. Li, Analysis and comparison of two general sparse solvers for distributed memory computers, ACM Transactions on Mathematical Software, vol.27, issue.4, pp.388-421, 2001.
DOI : 10.1145/504210.504212

URL : https://hal.archives-ouvertes.fr/hal-00856654

P. R. Amestoy, I. S. Duff, J. Excellent, and X. S. Li, Impact of the implementation of MPI point-to-point communications on the performance of two general sparse solvers, Parallel Computing, vol.29, issue.7, pp.29833-847, 2003.
DOI : 10.1016/S0167-8191(03)00067-X

URL : https://hal.archives-ouvertes.fr/hal-00807387

P. R. Amestoy, I. S. Duff, J. Excellent, Y. Robert, F. Rouet et al., On Computing Inverse Entries of a Sparse Matrix in an Out-of-Core Environment, SIAM Journal on Scientific Computing, vol.34, issue.4, pp.1975-1999, 2012.
DOI : 10.1137/100799411

URL : https://hal.archives-ouvertes.fr/hal-00763556

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, issue.11-12, pp.11-121645, 2003.
DOI : 10.1016/j.parco.2003.05.010

P. R. Amestoy, I. S. Duff, D. Ruiz, and B. Uçar, A Parallel Matrix Scaling Algorithm, High Performance Computing for Computational Science, VECPAR'08, number 5336 in Lecture Notes in Computer Science, pp.309-321, 2008.
DOI : 10.1007/978-3-540-92859-1_27

URL : https://hal.archives-ouvertes.fr/hal-00803489

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, vol.26, issue.2, pp.544-565, 2005.
DOI : 10.1137/S0895479802419877

P. R. Amestoy, A. Guermouche, J. Excellent, and S. Pralet, Hybrid scheduling for the parallel solution of linear systems, Parallel Computing, vol.32, issue.2, pp.136-156, 2006.
DOI : 10.1016/j.parco.2005.07.004

URL : https://hal.archives-ouvertes.fr/hal-00358623

P. R. Amestoy, X. S. Li, and E. G. Ng, Diagonal Markowitz Scheme with Local Symmetrization, SIAM Journal on Matrix Analysis and Applications, vol.29, issue.1, pp.228-244, 2007.
DOI : 10.1137/050637315

P. R. Amestoy, X. S. Li, and S. Pralet, Unsymmetric Ordering Using A Constrained Markowitz Scheme, SIAM Journal on Matrix Analysis and Applications, vol.29, issue.1, pp.302-327, 2007.
DOI : 10.1137/050622547

P. R. Amestoy and C. Puglisi, An Unsymmetrized Multifrontal LU Factorization, SIAM Journal on Matrix Analysis and Applications, vol.24, issue.2, pp.553-569, 2002.
DOI : 10.1137/S0895479800375370

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.889

G. Antoniu, E. Caron, F. Desprez, A. , and M. Jan, Towards a Transparent Data Access Model for the GridRPC Paradigm, 14th International Conference on High Performance Computing., number 4873 in LNCS, pp.269-284, 2007.
DOI : 10.1007/978-3-540-77220-0_27

URL : https://hal.archives-ouvertes.fr/inria-00110967

M. Arioli, J. Demmel, and I. S. Duff, Solving Sparse Linear Systems with Sparse Backward Error, SIAM Journal on Matrix Analysis and Applications, vol.10, issue.2, pp.165-190, 1989.
DOI : 10.1137/0610013

URL : http://puma.isti.cnr.it/rmydownload.php?filename=cnr.isti/cnr.iei/1988-B4-034/1988-B4-034_0.pdf

C. Ashcraft and R. G. Grimes, The influence of relaxed supernode partitions on the multifrontal method, ACM Transactions on Mathematical Software, vol.15, issue.4, pp.291-309, 1989.
DOI : 10.1145/76909.76910

C. Ashcraft and J. W. Liu, Robust Ordering of Sparse Matrices using Multisection, SIAM Journal on Matrix Analysis and Applications, vol.19, issue.3, pp.816-832, 1998.
DOI : 10.1137/S0895479896299081

H. Avron, G. Shklarski, and S. Toledo, Parallel unsymmetric-pattern multifrontal sparse LU with column preordering, ACM Transactions on Mathematical Software, vol.34, issue.2, pp.1-831, 2008.
DOI : 10.1145/1326548.1326550

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.7234

J. R. Bunch and L. Kaufman, Some stable methods for calculating inertia and solving symmetric linear systems, Mathematics of Computation, vol.31, issue.137, pp.162-179, 1977.
DOI : 10.1090/S0025-5718-1977-0428694-0

J. R. Bunch and B. N. Parlett, Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations, SIAM Journal on Numerical Analysis, vol.8, issue.4, pp.639-655, 1971.
DOI : 10.1137/0708060

A. Buttari, Fine Granularity Sparse QR Factorization for Multicore Based Systems, 2011.
DOI : 10.1137/0910005

E. Caron, S. Chaumette, S. Contassot-vivier, F. Desprez, E. Fleury et al., Scilab to Scilab//: The Ouragan project, Parallel Computing, vol.27, issue.11, pp.111497-1519, 2001.
DOI : 10.1016/S0167-8191(01)00101-6

URL : https://hal.archives-ouvertes.fr/inria-00000277

E. Caron and F. Desprez, Diet: A Scalable Toolbox to Build Network Enabled Servers on the Grid, International Journal of High Performance Computing Applications, vol.20, issue.3, pp.335-352, 2006.
DOI : 10.1177/1094342006067472

URL : https://hal.archives-ouvertes.fr/hal-01429867

S. Chakrabarti, J. Demmel, and K. A. Yelick, Modeling the benefits of mixed data and task parallelism, Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures , SPAA '95, pp.74-83, 1995.
DOI : 10.1145/215399.215423

K. M. Chandy and L. Lamport, Distributed snapshots: determining global states of distributed systems, ACM Transactions on Computer Systems, vol.3, issue.1, pp.63-75, 1985.
DOI : 10.1145/214451.214456

C. Chevalier and F. Pellegrini, PT-Scotch: A tool for efficient parallel graph ordering, Proceedings of PMAA2006, 2006.
DOI : 10.1016/j.parco.2007.12.001

URL : https://hal.archives-ouvertes.fr/hal-00402893

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, pp.95-283, 1995.

I. Chowdhury and J. Excellent, Some experiments and issues to exploit multicore parallelism in a distributed-memory parallel sparse direct solver, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00524249

R. Choy, A. Edelman, J. R. Gilbert, V. Shah, and D. Cheng, Star-p: High productivity parallel computing, 8th Annual Workshop on High-Performance Embedded Computing (HPEC 04), 2004.

T. H. Cormen, E. R. Davidson, and S. Chatterjee, Asynchronous buffered computation design and engineering framework generator (ABCDEFG), 19th International Parallel and Distributed Processing Symposium (IPDPS'05), 2005.

O. Cozette, Contributions systèmes pour le traitement de grandes masses de données sur grappes, 2003.

O. Cozette, A. Guermouche, and G. Utard, Adaptive paging for a multifrontal solver, Proceedings of the 18th annual international conference on Supercomputing , ICS '04, pp.267-276, 2004.
DOI : 10.1145/1006209.1006247

T. A. Davis, Algorithm 832, ACM Transactions on Mathematical Software, vol.30, issue.2, pp.196-199, 2004.
DOI : 10.1145/992200.992206

T. A. Davis, Algorithm 915: SuiteSparseQR: Multifrontal multithreaded sparse QR factorization, ACM Transactions on Mathematical Software, vol.388, issue.1, pp.1-822, 2011.

T. A. Davis and I. S. Duff, An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization, SIAM Journal on Matrix Analysis and Applications, vol.18, issue.1, pp.140-158, 1997.
DOI : 10.1137/S0895479894246905

M. J. Daydé and I. S. Duff, Use of level 3 BLAS in LU factorization in a multiprocessing environment on three vector multiprocessors, the ALLIANT FX, the CRAY-2, and the IBM 3090

M. J. Daydé and I. S. Duff, A block implementation of level 3 BLAS for RISC processors, 1996.

M. J. Daydé, L. Giraud, M. Hernandez, J. Excellent, C. Puglisi et al., An Overview of the GRID-TLSE Project, Poster Session of 6th International Meeting VECPAR'04, pp.851-856, 2004.

J. W. Demmel, S. C. Eisenstat, J. R. Gilbert, X. S. Li, and J. W. Liu, A Supernodal Approach to Sparse Partial Pivoting, SIAM Journal on Matrix Analysis and Applications, vol.20, issue.3, pp.720-755, 1999.
DOI : 10.1137/S0895479895291765

F. Desprez and F. Suter, Impact of mixed-parallelism on parallel implementations of Strassen and Winograd matrix multiplication algorithms. Concurrency and Computation: Practice and Experience, pp.771-797, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00072106

F. Dobrian, External memory algorithms for factoring sparse matrices, 2001.

F. Dobrian and A. Pothen, Oblio: a sparse direct solver library for serial and parallel computations, 2000.

F. Dobrian and A. Pothen, The design of I/O-efficient sparse direct solvers, Proceedings of the 2001 ACM/IEEE conference on Supercomputing (CDROM) , Supercomputing '01, 2001.
DOI : 10.1145/582034.582073

J. Dongarra, R. Hempel, A. J. Hey, and D. W. Walker, MPI : A message passing interface standard, Int. Journal of Supercomputer Applications, vol.8, issue.3, 1995.

J. J. Dongarra, J. Du-croz, I. S. Duff, and S. Hammarling, A set of level 3 basic linear algebra subprograms, ACM Transactions on Mathematical Software, vol.16, issue.1, pp.1-17, 1990.
DOI : 10.1145/77626.79170

I. S. Duff, Parallel implementation of multifrontal schemes, Parallel Computing, vol.3, issue.3, pp.193-204, 1986.
DOI : 10.1016/0167-8191(86)90019-0

I. S. Duff, Multiprocessing a sparse matrix code on the Alliant FX/8, Journal of Computational and Applied Mathematics, vol.27, issue.1-2, pp.229-239, 1989.
DOI : 10.1016/0377-0427(89)90368-3

I. S. Duff and J. Koster, The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices, SIAM Journal on Matrix Analysis and Applications, vol.20, issue.4, pp.889-901, 1999.
DOI : 10.1137/S0895479897317661

I. S. Duff and J. Koster, On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix, SIAM Journal on Matrix Analysis and Applications, vol.22, issue.4, pp.973-996, 2001.
DOI : 10.1137/S0895479899358443

I. S. Duff and S. Pralet, Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems, SIAM Journal on Matrix Analysis and Applications, vol.27, issue.2, pp.313-340, 2005.
DOI : 10.1137/04061043X

I. S. Duff and J. K. Reid, MA27?a set of Fortran subroutines for solving sparse symmetric sets of linear equations, 1982.

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

I. S. Duff and J. K. Reid, The Multifrontal Solution of Unsymmetric Sets of Linear Equations, SIAM Journal on Scientific and Statistical Computing, vol.5, issue.3, pp.633-641, 1984.
DOI : 10.1137/0905045

I. S. Duff and J. K. Reid, Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems, ACM Transactions on Mathematical Software, vol.22, issue.2, pp.227-257, 1996.
DOI : 10.1145/229473.229480

S. C. Eisenstat and J. W. Liu, The Theory of Elimination Trees for Sparse Unsymmetric Matrices, SIAM Journal on Matrix Analysis and Applications, vol.26, issue.3, pp.686-705, 2005.
DOI : 10.1137/S089547980240563X

S. C. Eisenstat and J. W. Liu, A tree based dataflow model for the unsymmetric multifrontal method, Electronic Transaction on Numerical Analysis, vol.21, pp.1-19, 2005.

V. Espirat, Développement d'une approche multifrontale pour machines a mémoire distribuée et réseau hétérogène de stations de travail, stage 3ieme Année, ENSEEIHT-IRIT, 1996.

C. Farhat, J. Mandel, and F. Roux, Optimal convergence properties of the FETI domain decomposition method, Computer Methods in Applied Mechanics and Engineering, vol.115, issue.3-4, pp.365-385, 1994.
DOI : 10.1016/0045-7825(94)90068-X

A. F. `-evre, J. Excellent, and S. Pralet, Scilab and MATLAB interfaces to MUMPS, 2006.

H. Garcia-molina, Elections in a Distributed Computing System, IEEE Transactions on Computers, vol.31, issue.1, pp.47-59, 1982.
DOI : 10.1109/TC.1982.1675885

A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek et al., PVM-Parallel Virtual Machine: AUsers' Guide and Tutorial for Networked Parallel Computing, Computers in Physics, vol.9, issue.6, 1994.
DOI : 10.1063/1.4823450

A. Geist and E. G. Ng, Task scheduling for parallel sparse Cholesky factorization, International Journal of Parallel Programming, vol.27, issue.4, pp.291-314, 1989.
DOI : 10.1007/BF01407861

A. George and J. W. Liu, A quotient graph model for symmetric factorization, Sparse Matrix Proceedings, pp.154-175, 1978.

A. George and J. W. Liu, Computer Solution of Large Sparse Positive Definite Systems, 1981.

J. R. Gilbert and J. W. Liu, Elimination Structures for Unsymmetric Sparse $LU$ Factors, SIAM Journal on Matrix Analysis and Applications, vol.14, issue.2, pp.334-352, 1993.
DOI : 10.1137/0614024

J. R. Gilbert and E. G. Ng, Predicting structure in nonsymmetric sparse matrix factorizations

J. R. Gilbert and S. Toledo, High-performance out-of-core sparse LU factorization, Proceedings of the 9th SIAM Conference on Parallel Processing for Scientific Computing, 1999.

D. Gope, I. Chowdhury, and V. Jandhyala, DiMES, Proceedings of the 42nd annual conference on Design automation , DAC '05, pp.159-162, 2005.
DOI : 10.1145/1065579.1065622

R. L. Graham, Bounds on Multiprocessing Timing Anomalies, SIAM Journal on Applied Mathematics, vol.17, issue.2, pp.416-429, 1969.
DOI : 10.1137/0117039

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.8131

S. Graillat, Accurate Floating-Point Product and Exponentiation, IEEE Transactions on Computers, vol.58, issue.7, pp.994-1000, 2009.
DOI : 10.1109/TC.2008.215

URL : https://hal.archives-ouvertes.fr/hal-00164607

L. Grigori, J. W. Demmel, and X. S. Li, Parallel Symbolic Factorization for Sparse LU with Static Pivoting, SIAM Journal on Scientific Computing, vol.29, issue.3, pp.1289-1314, 2007.
DOI : 10.1137/050638102

A. Guermouche, Impact de l'ordonnancement sur l'occupation mémoire d'un solveur multifrontal paralì ele, 15ieme Rencontres Francophones en Parallélisme, pp.37-45, 2003.

]. A. Guermouche, ´ Etude et optimisation du comportement mémoire dans les méthodesparalì eles de factorisation de matrices creuses, 2004.

A. Guermouche and J. Excellent, Memory-based scheduling for a parallel multifrontal solver, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings., p.71, 2004.
DOI : 10.1109/IPDPS.2004.1303001

URL : https://hal.archives-ouvertes.fr/hal-00807282

A. Guermouche and J. Excellent, Optimal memory minimization algorithms for the multifrontal method, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00071409

A. Guermouche and J. Excellent, Flexible task allocation for the memory minimization of the multifrontal approach, Second International Workshop on Combinatorial Scientific Computing (CSC05), 2005.

A. Guermouche and J. Excellent, Constructing memory-minimizing schedules for multifrontal methods, ACM Transactions on Mathematical Software, vol.32, issue.1, pp.17-32, 2006.
DOI : 10.1145/1132973.1132975

URL : https://hal.archives-ouvertes.fr/hal-00358620

A. Guermouche, J. Excellent, and G. Utard, Impact of reordering on the memory of a multifrontal solver, Parallel Computing, vol.29, issue.9, pp.1191-1218, 2003.
DOI : 10.1016/S0167-8191(03)00099-1

URL : https://hal.archives-ouvertes.fr/hal-00807378

A. Gupta, Recent advances in direct methods for solving unsymmetric sparse systems of linear equations, ACM Transactions on Mathematical Software, vol.28, issue.3, pp.301-324, 2002.
DOI : 10.1145/569147.569149

A. Gupta, A shared-and distributed-memory parallel general sparse direct solver Applicable Algebra in Engineering, Communication and Computing, vol.18, issue.3, pp.263-277, 2007.

A. Gupta, Y. Muliadi, T. J. Watson-research, and . Center, An experimental comparison of some direct sparse solver packages, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001, 2000.
DOI : 10.1109/IPDPS.2001.925182

L. He and Y. Sun, On distributed snapshot algorithms, Advances in Parallel and Distributed Computing Conference (APDC '97, pp.291-297, 1997.

M. T. Heath, E. G. Ng, and B. W. Peyton, Parallel Algorithms for Sparse Linear Systems, SIAM Review, vol.33, issue.3, pp.420-460, 1991.
DOI : 10.1137/1033099

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

N. J. Higham, A Survey of Condition Number Estimation for Triangular Matrices, SIAM Review, vol.29, issue.4, pp.575-596, 1987.
DOI : 10.1137/1029112

J. Hogg, J. K. Reid, and J. A. Scott, Design of a Multicore Sparse Cholesky Factorization Using DAGs, SIAM Journal on Scientific Computing, vol.32, issue.6, 2009.
DOI : 10.1137/090757216

H. Hsl, A collection of Fortran codes for large scale scientific computation, 2007.

D. Irony, G. Shklarski, and S. Toledo, Parallel and fully recursive multifrontal sparse Cholesky, Future Generation Computer Systems, vol.20, issue.3, pp.425-440, 2004.
DOI : 10.1016/j.future.2003.07.007

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.381.829

M. Jacquelin, L. Marchal, Y. Robert, and B. Uçar, On Optimal Tree Traversals for Sparse Matrix Factorization, 2011 IEEE International Parallel & Distributed Processing Symposium, 2011.
DOI : 10.1109/IPDPS.2011.60

URL : https://hal.archives-ouvertes.fr/hal-00945078

C. Jeannerod, N. Louvet, and J. Muller, Further analysis of Kahan???s algorithm for the accurate computation of $2\times 2$ determinants, Mathematics of Computation, vol.82, issue.284, 2012.
DOI : 10.1090/S0025-5718-2013-02679-8

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, 1998.

G. Karypis and K. Schloegel, ParMetis: Parallel Graph Partitioning and Sparse Matrix Ordering Library Version 4.0, Users' manual, 2003.
DOI : 10.1006/jpdc.1997.1403

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.896

X. S. Li, Evaluation of SuperLU on multicore architectures, Journal of Physics: Conference Series, vol.125, p.12079, 2008.
DOI : 10.1088/1742-6596/125/1/012079

X. S. Li and J. W. , Making sparse Gaussian elimination scalable by static pivoting, Proceedings of Supercomputing, 1998.

X. S. Li and J. W. , SuperLU DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems, ACM Transactions on Mathematical Software, vol.29, issue.2, 2003.

J. W. Liu, Modification of the minimum-degree algorithm by multiple elimination, ACM Transactions on Mathematical Software, vol.11, issue.2, pp.141-153, 1985.
DOI : 10.1145/214392.214398

J. W. Liu, On the storage requirement in the out-of-core multifrontal method for sparse factorization, ACM Transactions on Mathematical Software, vol.12, issue.3, pp.127-148, 1986.
DOI : 10.1145/7921.11325

J. W. 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.
DOI : 10.1137/0608031

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

J. W. Liu, The Multifrontal Method for Sparse Matrix Solution: Theory and Practice, SIAM Review, vol.34, issue.1, pp.82-109, 1992.
DOI : 10.1137/1034004

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

O. Meshar, D. Irony, and S. Toledo, An out-of-core sparse symmetric-indefinite factorization method, ACM Transactions on Mathematical Software, vol.32, issue.3, pp.445-471, 2006.
DOI : 10.1145/1163641.1163645

W. E. Nagel, A. Arnold, M. Weber, H. Hoppe, and K. Solchenbach, VAMPIR: Visualization and analysis of MPI resources, pp.69-80, 1996.

L. Neal and G. Poole, A geometric analysis of Gaussian elimination. II. Linear Algebra and its Applications, pp.239-264, 1992.

E. G. Ng and P. Raghavan, Performance of Greedy Ordering Heuristics for Sparse Cholesky Factorization, SIAM Journal on Matrix Analysis and Applications, vol.20, issue.4, pp.902-914, 1999.
DOI : 10.1137/S0895479897319313

S. Operto, J. Virieux, P. R. Amestoy, J. Excellent, L. Giraud et al., 3D finite-difference frequency-domain modeling of visco-acoustic wave propagation using a massively parallel direct solver: A feasibility study, GEOPHYSICS, vol.72, issue.5, pp.72195-211, 2007.
DOI : 10.1190/1.2759835

URL : https://hal.archives-ouvertes.fr/insu-00355256

S. V. Parter, The Use of Linear Graphs in Gauss Elimination, SIAM Review, vol.3, issue.2, pp.119-130, 1961.
DOI : 10.1137/1003021

F. Pellegrini, Scotch 5.0 User's guide, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00410332

F. Pellegrini, J. Roman, and P. R. Amestoy, Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering, Proceedings of Irregular'99, pp.986-995, 1999.
DOI : 10.1002/(SICI)1096-9128(200002/03)12:2/3<69::AID-CPE472>3.0.CO;2-W

F. Pellegrini, J. Roman, and P. R. Amestoy, Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering. Concurrency: Practice and Experience, Preliminary version published in Proceedings of Irregular'99, pp.69-84, 2000.

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

S. Pralet and T. /. Pa, Constrained orderings and scheduling for parallel sparse linear algebra, 2004.

E. S. Quintana-ortí and R. A. Van-de-geijn, Updating an LU Factorization with Pivoting, ACM Transactions on Mathematical Software, vol.35, issue.2, pp.11-12, 2008.
DOI : 10.1145/1377612.1377615

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

J. Rigal and J. Gaches, On the Compatibility of a Given Solution With the Data of a Linear System, Journal of the ACM, vol.14, issue.3, pp.526-543, 1967.
DOI : 10.1145/321406.321416

E. Rothberg and S. C. Eisenstat, Node Selection Strategies for Bottom-Up Sparse Matrix Ordering, SIAM Journal on Matrix Analysis and Applications, vol.19, issue.3, pp.682-695, 1998.
DOI : 10.1137/S0895479896302692

E. Rothberg and R. Schreiber, Efficient Methods for Out-of-Core Sparse Cholesky Factorization, SIAM Journal on Scientific Computing, vol.21, issue.1, pp.129-144, 1999.
DOI : 10.1137/S1064827597322975

V. Rotkin and S. Toledo, The design and implementation of a new out-of-core sparse cholesky factorization method, ACM Transactions on Mathematical Software, vol.30, issue.1, pp.19-46, 2004.
DOI : 10.1145/974781.974783

F. Rouet, Memory and performance issues in parallel multifrontal factorizations and triangular solutions with sparse right-hand sides, 2012.
URL : https://hal.archives-ouvertes.fr/tel-00785748

D. Ruiz, A scaling algorithm to equilibrate both rows and columns norms in matrices, 2001.

C. Sánchez, H. B. Sipma, Z. Manna, and C. D. Gill, Efficient distributed deadlock avoidance with liveness guarantees, Proceedings of the 6th ACM & IEEE International conference on Embedded software , EMSOFT '06, pp.12-20, 2006.
DOI : 10.1145/1176887.1176891

O. Schenk and K. Gärtner, On fast factorization pivoting methods for sparse symmetric indefinite systems, 2004.

F. Schmuck and R. Haskin, GPFS: A shared-disk file system for large computing clusters, Proc. of the First Conference on File and Storage Technologies, 2002.

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

J. Schulze, Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods, Bit Numerical Mathematics, vol.41, issue.4, pp.800-841, 2001.
DOI : 10.1023/A:1021908421589

S. S. Shende and A. D. Malony, The Tau Parallel Performance System, International Journal of High Performance Computing Applications, vol.20, issue.2, pp.287-311, 2006.
DOI : 10.1177/1094342006064482

. Tz and . Slavova, Parallel triangular solution in the out-of-core multifrontal approach for solving large sparse linear systems, 2009.

M. Snir, S. W. Otto, S. Huss-lederman, D. W. Walker, and J. Dongarra, MPI: The Complete Reference, 1996.

F. Sourbier, S. Operto, J. Virieux, P. R. Amestoy, and J. Excellent, FWT2D: A massively parallel program for frequency-domain full-waveform tomography of wide-aperture seismic data???Part 2, Computers & Geosciences, vol.35, issue.3, pp.496-514, 2009.
DOI : 10.1016/j.cageo.2008.04.012

URL : https://hal.archives-ouvertes.fr/insu-00354706

S. D. Stoller, Leader election in asynchronous distributed systems, IEEE Transactions on Computers, vol.49, issue.3, pp.283-284, 2000.
DOI : 10.1109/12.841132

R. Takhur, W. Gropp, and E. Lusk, On implementing MPI-IO portably and with high performance, Proceedings of the 6th Workshop on I/O in Parallel and Distributed Systems, pp.23-32, 1999.

S. Toledo, A survey of out-of-core algorithms in numerical linear algebra, External Memory Algorithms and Visualization, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp.161-179, 1999.

S. Toledo and A. Uchitel, A Supernodal Out-of-Core Sparse Gaussian-Elimination Method, Proceedings of PPAM 2007, 2007.
DOI : 10.1007/978-3-540-68111-3_76

J. H. Wilkinson, Rounding Errors in Algebraic Processes, 1963.

M. Yannakakis, Computing the Minimum Fill-In is NP-Complete, SIAM Journal on Algebraic Discrete Methods, vol.2, issue.1, pp.77-79, 1981.
DOI : 10.1137/0602010