.png){kind=icon}
返回
SEParAT: scheduling support environment for parallel application task graphs
.png){kind=icon}
PRE
AI
DOI：10.1007/s10586-012-0211-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Programs using parallel tasks can be represented by task graphs so that scheduling algorithms can be used to find an efficient execution order of the parallel tasks. This article proposes a flexible, component-based and extensible scheduling framework called SEParAT that supports the scheduling of a parallel program in multiple ways. The article describes the functionality and the software architecture of SEParAT. The flexible interfaces enable the cooperation with other programming tools, e.g., tools exploiting a specification of the parallel task structure of an application. The core component of SEParAT is an extensible scheduling algorithm library that provides an infrastructure to determine efficient schedules for task graphs. Homogeneous as well as heterogeneous platforms can be handled. The article also includes detailed experimental results comprising the evaluation of SEParAT as well as the evaluation of a variety of scheduling algorithms.
Keyword:
Parallel programming
Scheduling
Task graph
Mixed parallelism
Tool support
Distributed memory
期刊
C
IF:
4.1
论文数:
5.0K
被引数:
7.5K
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容