A dual-mode scheduling approach for task graphs with data parallelism
A dual-mode scheduling approach for task graphs with data parallelism
复制标题
DOI：
10.1504/ijes.2017.10004392
复制
发表时间：
2017-04
期刊：
影响因子：
--
通讯作者：
Yang Liu;Lin Meng;Ittetsu Taniguchi;H. Tomiyama
中科院分区：
文献类型：
--
作者：
Yang Liu;Lin Meng;Ittetsu Taniguchi;H. Tomiyama
提出了一种多核/众核系统的任务调度算法。为了在较低的计算复杂度下提高结果的质量，我们的算法在任务调度过程中使用了两个静态优先级切换。在我们的实验中，我们比较了所提出的算法与国家的最先进的算法。实验结果表明，该算法产生更短的调度长度比我们以前的研究。
This paper proposes a task scheduling algorithm for multi/many-core systems. To increase the quality of results on the low computational complexity, our algorithm uses two static priorities switched during task scheduling. In our experiments, we compared the proposed algorithm with a state-of-the-art algorithm. The experimental results show that the proposed algorithm yields shorter scheduling length than our previous research.