Scheduling multiprocessor tasks -an overview, European Journal of Operational Research, vol.94, issue.2, pp.215-230, 1996. ,
Performance-effective and lowcomplexity task scheduling for heterogeneous computing, IEEE Transactions on Parallel and Distributed Systems, vol.13, issue.3, pp.260-274, 2002. ,
The legion vision of a worldwide virtual computer, Communications of the ACM, vol.40, issue.1, pp.39-45, 1997. ,
StarPU: a unified platform for task scheduling on heterogeneous multicore architectures, Concurrency and Computation: Practice and Experience, vol.23, issue.2, pp.187-198, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00384363
The Open Community Runtime: A runtime system for extreme scale computing, 2016 IEEE High Performance Extreme Computing Conference (HPEC), pp.1-7, 2016. ,
PaRSEC: Exploiting Heterogeneity to Enhance Scalability, Computing in Science Engineering, vol.15, issue.6, pp.36-45, 2013. ,
KAAPI: A thread scheduling runtime system for data flow computations on cluster of multiprocessors, International Workshop on Parallel Symbolic Computation, pp.15-23, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-00684843
Hierarchical taskbased programming with StarSs, IJHPCA, vol.23, issue.3, pp.284-299, 2009. ,
Scheduling dataintensiveworkflows onto storage-constrained distributed resources, CCGrid'07, pp.401-409, 2007. ,
Robust memory-aware mappings for parallel multifrontal factorizations, SIAM J. Scientific Computing, vol.38, issue.3, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-00726644
A fully asynchronous multifrontal solver using distributed dynamic scheduling, SIAM Journal on Matrix Analysis and Applications, vol.23, issue.1, pp.15-41, 2001. ,
URL : https://hal.archives-ouvertes.fr/hal-00808293
Parallel scheduling of dags under memory constraints, 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp.204-213, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01828312
Limiting the memory footprint when dynamically scheduling dags on shared-memory platforms, J. Parallel Distrib. Comput, vol.128, pp.30-42, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-01948462
The generation of optimal code for arithmetic expressions, Journal of the ACM, vol.17, issue.4, pp.715-728, 1970. ,
Complete register allocation problems, STOC'73, pp.182-195, 1973. ,
The pebbling problem is complete in polynomial space, SIAM J. Comput, vol.9, issue.3, 1980. ,
An application of generalized tree pebbling to sparse matrix factorization, SIAM J. Alg. Discrete Methods, vol.8, issue.3, pp.375-395, 1987. ,
Memory-optimal evaluation of expression trees involving large objects, Computer Languages, Systems & Structures, vol.37, issue.2, pp.63-75, 2011. ,
Parallel scheduling of task trees with limited memory, ACM Transactions on Parallel Computing, vol.2, issue.2, p.13, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01070356
Scheduling data-intensive workflows on storage constrained resources, Proc. of the 4th Workshop on Workflows in Support of Large-Scale Science (WORKS'09, 2009. ,
Controlling the memory subscription of distributed applications with a task-based runtime system, Proc. of IPDPS Workshops, pp.318-327, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01380126
Bounded memory scheduling of dynamic task graphs, Proc. of PACT, pp.343-356, 2014. ,
, Concurrent collections, vol.18, pp.203-217, 2010.
Cilkmem: Algorithms for analyzing the memory high-water mark of fork-join parallel programs, SIAM Symposium on Algorithmic Principles of Computer Systems, 2020. ,
On optimal tree traversals for sparse matrix factorization, Proc. of the Int. Par. & Dist. Processing Symposium (IPDPS), pp.556-567, 2011. ,
URL : https://hal.archives-ouvertes.fr/ensl-00527462
A note on a maximum k-subset intersection problem, Information Processing Letters, vol.112, issue.12, pp.471-472, 2012. ,
On scheduling series-parallel dags to maximize area, Int. J. Found. Comput. Sci, vol.25, issue.5, pp.597-622, 2014. ,
Scheduling uet-uct seriesparallel graphs on two processors, Theoretical Computer Science, vol.162, issue.2, pp.323-340, 1996. ,
URL : https://hal.archives-ouvertes.fr/inria-00074115
The recognition of series parallel digraphs, Proceedings of the eleventh annual ACM symposium on Theory of computing, pp.1-12, 1979. ,
Parallel algorithms for series parallel graphs and graphs with treewidth two 1, Algorithmica, vol.29, issue.4, pp.534-559, 2001. ,
Daggen: A synthetic task graph generator ,
One step toward bridging the gap between theory and practice in moldable task scheduling with precedence constraints, Concurrency and Computation: Practice and Experience, vol.27, pp.1010-1026, 2015. ,
A bi-criteria algorithm for scheduling parallel task graphs on clusters, pp.243-252, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00533904
Community resources for enabling research in distributed scientific workflows, 10th Int. Conf. on e-Science, vol.1, pp.177-184, 2014. ,
Implementing multifrontal sparse solvers for multicore architectures with sequential task flow runtime systems, ACM Trans. Math. Softw, vol.43, issue.2, p.13, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01333645
The university of florida sparse matrix collection, ACM Trans. Math. Softw, vol.38, issue.1, 2011. ,
Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm, ACM Trans. Math. Softw, vol.30, issue.3, pp.377-380, 2004. ,
Sparse matrix ordering with scotch, International Conference on High-Performance Computing and Networking, pp.370-378, 1997. ,
Gurobi optimizer reference manual, 2020. ,
Computers and Intractability, a Guide to the Theory of NP-Completeness, 1979. ,