Improving parallel executions by increasing task granularity in task-based runtime systems using acyclic DAG clustering.

ABSTRACT: The task-based approach is a parallelization paradigm in which an algorithm is transformed into a direct acyclic graph of tasks: the vertices are computational elements extracted from the original algorithm and the edges are dependencies between those. During the execution, the management of the dependencies adds an overhead that can become significant when the computational cost of the tasks is low. A possibility to reduce the makespan is to aggregate the tasks to make them heavier, while having fewer of them, with the objective of mitigating the importance of the overhead. In this paper, we study an existing clustering/partitioning strategy to speed up the parallel execution of a task-based application. We provide two additional heuristics to this algorithm and perform an in-depth study

SUBMITTER: Bramas B 

PROVIDER: S-EPMC7924455 | biostudies-literature | 2020

REPOSITORIES: biostudies-literature