HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Revisiting dynamic DAG scheduling under memory constraints for shared-memory platforms

Abstract : This work focuses on dynamic DAG scheduling under memory constraints.We target a shared-memory platform equipped with p parallel processors. We aim at bounding the maximum amount of memory that may be needed by any schedule using p processors to execute the DAG. We refine the classical model that computes maximum cuts by introducing two types of memory edges in the DAG, black edges for regular precedence constraints and red edges for actual memory consumption during execution. A valid edge cut cannot include more thanpred edges. This limitation had never been taken intoaccount in previous works, and dramatically changes the complexity of the problem, which was polynomial and becomes NP-hard. We introduce an Integer Linear Program (ILP) to solve it, together with an efficient heuristic based on rounding the rational solution ofthe ILP. In addition, we propose an exact polynomial algorithm for series-parallel graphs. We provide an extensive set of experiments, both with randomly-generated graphs and with graphs arising form practical applications, which demonstrate the impact of resource constraints on peak memory usage
Document type :
Complete list of metadata

Cited literature [40 references]  Display  Hide  Download

Contributor : Equipe Roma Connect in order to contact the contributor
Submitted on : Saturday, February 22, 2020 - 5:34:47 PM
Last modification on : Monday, May 16, 2022 - 4:46:02 PM
Long-term archiving on: : Saturday, May 23, 2020 - 3:27:25 PM


Files produced by the author(s)


  • HAL Id : hal-02488399, version 1


Gabriel Bathie, Loris Marchal, Yves Robert, Samuel Thibault. Revisiting dynamic DAG scheduling under memory constraints for shared-memory platforms. [Research Report] RR-9323, Inria. 2020. ⟨hal-02488399⟩



Record views


Files downloads