SEParAT: scheduling support environment for parallel application task graphs
SEParAT: scheduling support environment for parallel application task graphs
复制标题
DOI:
10.1007/s10586-012-0211-1
复制
发表时间:
2012-09
期刊:
影响因子:
--
通讯作者:
Jörg Dümmler;Raphael Kunis;G. Rünger
中科院分区:
文献类型:
--
作者:
Jörg Dümmler;Raphael Kunis;G. Rünger
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.