.png){kind=icon}
返回
Programming support and scheduling for communicating parallel tasks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2012.09.017.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Task-based programming models are beneficial for the development of parallel programs for several reasons. They provide a decoupling of the specification of parallelism from the scheduling and mapping to execution resources of a specific hardware platform, thus allowing a flexible and individual mapping. For platforms with a distributed address space, the use of parallel tasks, instead of sequential tasks, adds the additional advantage of a structuring of the program into communication domains that can help to reduce the overall communication overhead. In this article, we consider the parallel programming model of communicating parallel tasks (CM-tasks), which allows both task-internal communication as well as communication between concurrently executed tasks at arbitrary points of their execution. We propose a corresponding scheduling algorithm and describe how the scheduling is supported by a transformation tool. An experimental evaluation using synthetic task graphs as well as several complex application programs shows that employing the CM-task model may lead to significant performance improvements compared to other parallel execution schemes. (C) 2012 Elsevier Inc. All rights reserved.
Keyword:
Parallel tasks
Scheduling
Mixed parallelism
Algorithms
Scalability
Tool support
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
Optimal DSI reconstruction parameter recommendations: Better ODFs and better connectivity.png)
NeuroImage
NeuroImageIF0
PREAI
分享收藏
查看更多内容