Mapping Tree-shaped Workflows on Memory-heterogeneous Architectures - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2022

Mapping Tree-shaped Workflows on Memory-heterogeneous Architectures


Directed acyclic graphs are commonly used to model scientific workflows, by expressing dependencies between tasks, as well as the resource requirements of the workflow. As a special case, rooted directed trees occur in several applications. Since typical workflows are modeled by huge trees, it is crucial to schedule them efficiently. We investigate the partitioning and mapping of tree-shaped workflows on target architectures where each processor can have a different memory size. Our three-step heuristic adapts and extends previous work for homogeneous clusters. In particular, we design a novel algorithm to assign subtrees to processors with different memory sizes, and we show how to select appropriate processors when splitting or merging subtrees. The experiments demonstrate that exploiting the heterogeneity reduces the makespan significantly compared to the state of the art for homogeneous memories.
Fichier principal
Vignette du fichier
paper_heteropar.pdf (333.17 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03921445 , version 1 (03-01-2023)


  • HAL Id : hal-03921445 , version 1


Svetlana Kulagina, Henning Meyerhenke, Anne Benoit. Mapping Tree-shaped Workflows on Memory-heterogeneous Architectures. 20th Int. Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Platforms (HeteroPar), Aug 2022, Glasgow, United Kingdom. ⟨hal-03921445⟩
48 View
19 Download


Gmail Facebook X LinkedIn More