.png){kind=icon}
返回
Improving parallel executions by increasing task granularity in task-based runtime systems using acyclic DAG clustering
.png){kind=icon}
OA
AI
DOI：10.7717/peerj-cs.247.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 on a large graph set. In addition, we propose a new model to estimate the execution duration and use it to choose the proper granularity. We show that this strategy allows speeding up a real numerical application by a factor of 7 on a multi-core system.
Keyword:
Task-based
Graph
DAG
Clustering
Partitioning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.5
论文数:
3.4K
被引数:
6.9K
机构
引用论文
分享收藏Potassium Fractions and Rice Yield in Different Agro-ecological Zones of Bangladesh钾组分与孟加拉国不同农业生态区的水稻产量
OAAI
OAAI分享收藏Label-free three-dimensional imaging of Caenorhabditis elegans with visible optical coherence microscopy.png)
PLOS ONEOAAI
PLOS ONEIF0
OAAI分享收藏
查看更多内容