E. Agullo, A. Buttari, A. Guermouche, and F. Lopez, Multifrontal QR Factorization for Multicore Architectures over Runtime Systems, Euro-Par 2013 Parallel Processing, 2013.
DOI : 10.1007/978-3-642-40047-6_53
URL : https://hal.archives-ouvertes.fr/hal-01220611

E. Agullo, J. Demmel, J. Dongarra, B. Hadri, J. Kurzak et al., Numerical linear algebra on emerging architectures: The PLASMA and MAGMA projects, Journal of Physics: Conference Series, vol.180, issue.1, pp.1742-6596, 2009.
DOI : 10.1088/1742-6596/180/1/012037

E. Agullo, J. Dongarra, R. Nath, and S. Tomov, A Fully Empirical Autotuned Dense QR Factorization for Multicore Architectures, p.5328, 2011.
DOI : 10.1007/978-3-642-23397-5_19
URL : https://hal.archives-ouvertes.fr/hal-00726654

R. Allen and K. Kennedy, Optimizing Compilers for Modern Architectures: A Dependence-Based Approach, 2002.

R. Patrick, I. S. Amestoy, C. Duff, and . Puglisi, Multifrontal QR factorization in a multiprocessor environment, Int. Journal of Num. Linear Alg. and Appl, vol.3, issue.4, pp.275-300, 1996.

S. Nimar, R. D. Arora, C. G. Blumofe, and . Plaxton, Thread Scheduling for Multiprogrammed Multiprocessors, Theory Comput. Syst, vol.34, issue.2, pp.115-144, 2001.

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, Special Issue: Euro-Par, pp.187-198, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00384363

R. M. Badia, J. R. Herrero, J. Labarta, J. M. Pérez, E. S. Quintana-ortí et al., Parallelizing dense and banded linear algebra libraries using SMPSs, Concurrency and Computation: Practice and Experience, vol.14, issue.7, pp.18-2438, 2009.
DOI : 10.1002/cpe.1463

G. Bosilca, A. Bouteiller, A. Danalis, T. Hérault, P. Lemarinier et al., DAGuE: A generic distributed DAG engine for High Performance Computing, Parallel Comput, vol.38, pp.1-2, 2012.

H. Bouwmeester, M. Jacquelin, J. Langou, and Y. Robert, Tiled QR Factorization Algorithms Networking, Storage and Analysis (SC '11), Proceedings of 2011 International Conference for High Performance Computing, pp.1-7, 2011.

Z. Budimli´cbudimli´c, M. Burke, V. Cavé, K. Knobe, G. Lowney et al., Concurrent Collections, Scientific Programming, vol.18, issue.3-4, pp.203-217, 2010.
DOI : 10.1155/2010/521797

A. Buttari, Fine-Grained Multithreading for the Multifrontal $QR$ Factorization of Sparse Matrices, SIAM Journal on Scientific Computing, vol.35, issue.4, pp.323-345, 2013.
DOI : 10.1137/110846427
URL : https://hal.archives-ouvertes.fr/hal-01122471

A. Buttari, J. Langou, J. Kurzak, and J. Dongarra, A class of parallel tiled linear algebra algorithms for multicore architectures, Parallel Computing, vol.35, issue.1, pp.38-53, 2009.
DOI : 10.1016/j.parco.2008.10.002

M. Cosnard and E. Jeannot, AUTOMATIC PARALLELIZATION TECHNIQUES BASED ON COMPACT DAG EXTRACTION AND SYMBOLIC SCHEDULING, Parallel Processing Letters, vol.11, issue.01, pp.151-168, 2001.
DOI : 10.1142/S012962640100049X
URL : https://hal.archives-ouvertes.fr/inria-00000278

T. A. Davis, Algorithm 915, SuiteSparseQR, ACM Transactions on Mathematical Software, vol.38, issue.1, pp.1-8, 2011.
DOI : 10.1145/2049662.2049670

A. Timothy, Y. Davis, and . Hu, The university of Florida sparse matrix collection, ACM Trans. Math. Softw, vol.38, issue.1, pp.1-1, 2011.

J. Demmel, L. Grigori, M. Hoemmen, and J. Langou, Communication-optimal Parallel and Sequential QR and LU Factorizations, SIAM Journal on Scientific Computing, vol.34, issue.1, pp.206-239, 2012.
DOI : 10.1137/080731992
URL : https://hal.archives-ouvertes.fr/hal-00870930

W. Edsger and . Dijkstra, Een algorithme ter voorkoming van de dodelijke omarming, 1965.

W. Edsger and . Dijkstra, The Mathematics Behind the Banker's Algorithm, Selected Writings on Computing: A personal Perspective, pp.308-312, 1982.

J. Dongarra, M. Faverge, T. Hérault, M. Jacquelin, J. Langou et al., Hierarchical QR factorization algorithms for multi-core clusters, Parallel Computing, vol.39, issue.4-5, pp.4-5, 2013.
DOI : 10.1016/j.parco.2013.01.003
URL : https://hal.archives-ouvertes.fr/hal-00809770

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

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, pp.1-13, 2015.
DOI : 10.1145/2779052
URL : https://hal.archives-ouvertes.fr/hal-01160118

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

. Abdou-guermouche, L. Jean-yves, G. Excellent, and . 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

E. Hermann, B. Raffin, F. Faure, T. Gautier, and J. Allard, Multi-GPU and Multi-CPU Parallelization for Interactive Physics Simulations, Euro-Par, pp.235-246, 2010.
DOI : 10.1007/978-3-642-15291-7_23
URL : https://hal.archives-ouvertes.fr/inria-00502448

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, pp.3627-3649, 2010.
DOI : 10.1137/090757216

K. Kim and V. Eijkhout, A Parallel Sparse Direct Solver via Hierarchical DAG Scheduling, ACM Transactions on Mathematical Software, vol.41, issue.1, pp.1-3, 2014.
DOI : 10.1145/2629641

J. Kurzak and J. Dongarra, Fully Dynamic Scheduler for Numerical Computing on Multicore Processors. LAPACK working note lawn220, 2009.

X. Lacoste, M. Faverge, P. Ramet, S. Thibault, and G. Bosilca, Taking Advantage of Hybrid Systems for Sparse Direct Solvers via Task-Based Runtimes, 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, 2014.
DOI : 10.1109/IPDPSW.2014.9
URL : https://hal.archives-ouvertes.fr/hal-00925017

W. H. Joseph and . Liu, On the storage requirement in the out-of-core multifrontal method for sparse factorization, ACM Transactions On Mathematical Software, vol.12, pp.127-148, 1986.

F. Pellegrini and J. Roman, Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs, Proceedings of HPCN'96, pp.1067-493, 1996.
DOI : 10.1007/3-540-61142-8_588

G. Quintana-ortí, E. S. Quintana-ortí, R. A. Van-de-geijn, G. Field, E. Van-zee et al., Programming matrix algorithms-by-blocks for thread-level parallelism, ACM Transactions on Mathematical Software, vol.36, issue.3, p.3, 2009.
DOI : 10.1145/1527286.1527288

F. Rouet, Memory and performance issues in parallel multifrontal factorizations and triangular solutions with sparse right-hand sides, Thèse de doctorat. Institut National Polytechnique de Toulouse, 2012.
URL : https://hal.archives-ouvertes.fr/tel-00785748

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

H. Topcuouglu, S. Hariri, and M. Wu, Performance-effective and low-complexity task scheduling for heterogeneous computing, IEEE Transactions on Parallel and Distributed Systems, vol.13, issue.3, pp.260-274, 2002.
DOI : 10.1109/71.993206