Starpu: a unified platform for task scheduling on heterogeneous multicore architectures. Concurrency and Computation: Practice and Experience, pp.187-198, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00384363
Tree traversals with task-memory affinities, Research report, vol.8226 ,
DOI : 10.1016/j.jpdc.2014.10.004
URL : https://hal.archives-ouvertes.fr/hal-00787753
A Class of Hybrid LAPACK Algorithms for Multicore and GPU Architectures, 2011 Symposium on Application Accelerators in High-Performance Computing, pp.150-158, 2011. ,
DOI : 10.1109/SAAHPC.2011.18
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
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
An Application of Generalized Tree Pebbling to Sparse Matrix Factorization, SIAM Journal on Algebraic Discrete Methods, vol.8, issue.3, 1987. ,
DOI : 10.1137/0608031
Scheduling Tree-Shaped Task Graphs to Minimize Memory and Makespan, 2013 IEEE 27th International Symposium on Parallel and Distributed Processing ,
DOI : 10.1109/IPDPS.2013.55
URL : https://hal.archives-ouvertes.fr/hal-00740105
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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.3658
Complete register allocation problems, STOC'73, pp.182-195, 1973. ,
DOI : 10.1137/0204020
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.7491
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
MAGMA version User's guide, 2009. ,