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

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.249-264, 1986.
DOI : 10.1145/7921.11325

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

E. Agullo, P. Amestoy, A. Buttari, A. Guermouche, J. Excellent et al., Robust Memory-Aware Mappings for Parallel Multifrontal Factorizations, 2012, SIAM conf. on Parallel Processing for Scientific Computing (PP12)
DOI : 10.1137/130938505
URL : https://hal.archives-ouvertes.fr/hal-00726644

A. Ramakrishnan, G. Singh, H. Zhao, E. Deelman, R. Sakellariou et al., Scheduling Data-IntensiveWorkflows onto Storage-Constrained Distributed Resources, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07), 2007.
DOI : 10.1109/CCGRID.2007.101

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

R. Sethi and J. 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. Sethi, Complete register allocation problems, Proceedings of the 5th Annual ACM Symposium on Theory of Computing (STOC'73, pp.182-195, 1973.

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

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

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

L. Marchal, O. Sinnen, and F. Vivien, Scheduling treeshaped task graphs to minimize memory and makespan, INRIA, Research report 8082, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00740105

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

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

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.

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