Limiting the memory footprint when dynamically scheduling DAGs on shared-memory platforms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Parallel and Distributed Computing Year : 2019

Limiting the memory footprint when dynamically scheduling DAGs on shared-memory platforms

Abstract

Scientific workflows are frequently modeled as Directed Acyclic Graphs (DAGs) of tasks, which represent computational modules and their dependences in the form of data produced by a task and used by another one. This formulation allows the use of runtime systems which dynamically allocate tasks onto the resources of increasingly complex computing platforms. However, for some workflows, such a dynamic schedule may run out of memory by processing too many tasks simultaneously. This paper focuses on the problem of transforming such a DAG to prevent memory shortage, and concentrates on shared memory platforms. We first propose a simple model of DAGs which is expressive enough to emulate complex memory behaviors. We then exhibit a polynomial-time algorithm that computes the maximum peak memory of a DAG, that is, the maximum memory needed by any parallel schedule. We consider the problem of reducing this maximum peak memory to make it smaller than a given bound. Our solution consists in adding new fictitious edges, while trying to minimize the critical path of the graph. After proving that this problem is NP-complete, we provide an ILP solution as well as several heuristic strategies that are thoroughly compared by simulation on synthetic DAGs modeling actual computational workflows. We show that on most instances we are able to decrease the maximum peak memory at the cost of a small increase in the critical path, thus with little impact on the quality of the final parallel schedule.
Fichier principal
Vignette du fichier
jpdc-revision.pdf (404.43 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-02025521 , version 1 (19-02-2019)

Identifiers

Cite

Loris Marchal, Bertrand Simon, Frédéric Vivien. Limiting the memory footprint when dynamically scheduling DAGs on shared-memory platforms. Journal of Parallel and Distributed Computing, 2019, 128, pp.30-42. ⟨10.1016/j.jpdc.2019.01.009⟩. ⟨hal-02025521⟩
281 View
786 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More