E. Agullo, P. Amestoy, A. Buttari, A. Guermouche, L. Jean-yves et al., Robust Memory-Aware Mappings for Parallel Multifrontal Factorizations, SIAM conf. on Parallel Processing for Scientific Computing (PP12), 2012.
DOI : 10.1137/130938505

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

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

J. R. Gilbert, T. Lengauer, and R. E. Tarjan, The pebbling problem is complete in polynomial space, SIAM J. Comput, vol.9, issue.3, 1980.

J. R. Gilbert, G. L. Miller, and S. Teng, Geometric Mesh Partitioning: Implementation and Experiments, SIAM Journal on Scientific Computing, vol.19, issue.6, pp.2091-2110, 1998.
DOI : 10.1137/S1064827594275339

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

R. L. Graham, Bounds for Certain Multiprocessing Anomalies, Bell System Technical Journal, vol.45, issue.9, pp.1563-1581, 1966.
DOI : 10.1002/j.1538-7305.1966.tb01709.x

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

T. C. Hu, Parallel Sequencing and Assembly Line Problems, Operations Research, vol.9, issue.6, 1961.
DOI : 10.1287/opre.9.6.841

J. J. Hwang, Y. C. Chow, F. D. Anger, and C. Y. Lee, Scheduling Precedence Graphs in Systems with Interprocessor Communication Times, SIAM Journal on Computing, vol.18, issue.2, 1989.
DOI : 10.1137/0218016

M. Jacquelin, L. Marchal, Y. Robert, and B. Ucar, 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

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. U. of Minnesota, Dpt. of Comp. Sci. and Eng, 1998.

C. Lam, T. Rauber, G. Baumgartner, D. Cociorva, and P. Sadayappan, Memory-optimal evaluation of expression trees involving large objects, Computer Languages, Systems & Structures, vol.37, issue.2, pp.63-75, 2011.
DOI : 10.1016/j.cl.2010.09.003

J. K. Lenstra, A. H. Kan, and P. Brucker, Complexity of Machine Scheduling Problems, Annals of Discrete Mathematics, vol.1, pp.343-362, 1977.
DOI : 10.1016/S0167-5060(08)70743-X

W. H. Joseph and . Liu, On the storage requirement in the out-of-core multifrontal method for sparse factorization, ACM Trans. Math. Software, vol.12, issue.3, pp.249-264, 1986.

W. H. Joseph and . Liu, An application of generalized tree pebbling to sparse matrix factorization, SIAM J. Algebraic Discrete Methods, vol.8, issue.3, 1987.

A. Ramakrishnan, G. Singh, H. Zhao, E. Deelman, R. Sakellariou et al., Scheduling dataintensiveworkflows onto storage-constrained distributed resources, CCGRID'07, 2007.
DOI : 10.1109/ccgrid.2007.101

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

R. Sethi, Complete register allocation problems, STOC'73, pp.182-195, 1973.
DOI : 10.1137/0204020

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

R. Sethi and J. D. Ullman, The Generation of Optimal Code for Arithmetic Expressions, Journal of the ACM, vol.17, issue.4, pp.715-728, 1970.
DOI : 10.1145/321607.321620

R. N°-8082 and R. Centre-grenoble-?-rhône-alpes, Inovallée 655 avenue de l'Europe Montbonnot 38334 Saint Ismier Cedex Publisher Inria Domaine de Voluceau -Rocquencourt BP 105 -78153 Le Chesnay Cedex inria, pp.249-6399