Title: A dual-mode scheduling approach for task graphs with data parallelism

Authors: Yang Liu; Lin Meng; Ittetsu Taniguchi; Hiroyuki Tomiyama

Addresses: Graduate School of Science and Engineering, Ritsumeikan University, Noji-Higashi 1-1-1, Kusatsu, Shiga, 525-8577, Japan ' College of Science and Engineering, Ritsumeikan University, Noji-Higashi 1-1-1, Kusatsu, Shiga, 525-8577, Japan ' College of Science and Engineering, Ritsumeikan University, Noji-Higashi 1-1-1, Kusatsu, Shiga, 525-8577, Japan ' College of Science and Engineering, Ritsumeikan University, Noji-Higashi 1-1-1, Kusatsu, Shiga, 525-8577, Japan

Abstract: 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.

Keywords: task scheduling; multicore; task parallelism; data parallelism.

DOI: 10.1504/IJES.2017.083734

International Journal of Embedded Systems, 2017 Vol.9 No.2, pp.147 - 156

Received: 05 Nov 2014
Accepted: 13 Jul 2015
Published online: 21 Apr 2017 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article