Limiting the memory footprint when dynamically scheduling DAGs on shared-memory platforms
Authors:
- Loris MarchalLMLoris Marchal
- Bertrand SimonBSBertrand Simon
- Frédéric VivienFVFrédéric Vivien
- 1 June 2019
- journal article
- conference paper
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 128, 30-42
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- PaRSEC: Exploiting Heterogeneity to Enhance ScalabilityComputing in Science & Engineering, 2013
- On the algorithmic effectiveness of digraph decompositions and complexity measuresDiscrete Optimization, 2011
- StarPU: a unified platform for task scheduling on heterogeneous multicore architecturesConcurrency and Computation: Practice and Experience, 2010
- Register Saturation in Instruction Level ParallelismInternational Journal of Parallel Programming, 2005
- Sequential and parallel algorithms for minimum flowsJournal of Applied Mathematics and Computing, 2004
- An Application of Generalized Tree Pebbling to Sparse Matrix FactorizationSIAM Journal on Algebraic Discrete Methods, 1987
- The Pebbling Problem is Complete in Polynomial SpaceSIAM Journal on Computing, 1980
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Complete Register Allocation ProblemsSIAM Journal on Computing, 1975
- The Generation of Optimal Code for Arithmetic ExpressionsJournal of the ACM, 1970