Minimizing memory in parallel task graph scheduling: Focusing on average consumption
- 10 June 2026
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 215
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- A scheduler to foster data locality for GPU and out-of-core task-based linear algebra applicationsJournal of Parallel and Distributed Computing, 2025
- Limiting the memory footprint when dynamically scheduling DAGs on shared-memory platformsJournal of Parallel and Distributed Computing, 2019
- Malleable Task-Graph Scheduling with a Practical Speed-Up ModelIEEE Transactions on Parallel and Distributed Systems, 2018
- Scheduling series-parallel task graphs to minimize peak memoryTheoretical Computer Science, 2018
- Linear time algorithms to solve the linear ordering problem for oriented tree based graphsRAIRO - Operations Research, 2016
- A polynomial algorithm for minDSC on a subclass of series Parallel graphsRAIRO - Operations Research, 2009
- Memory management optimization problems for integrated circuit simulatorsDiscrete Applied Mathematics, 2007
- An Application of Generalized Tree Pebbling to Sparse Matrix FactorizationSIAM Journal on Algebraic Discrete Methods, 1987
- The Recognition of Series Parallel DigraphsSIAM Journal on Computing, 1982
- Optimal Linear OrderingSIAM Journal on Applied Mathematics, 1973