A dual-mode scheduling algorithm for task graphs with data parallelism

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 which are 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 the better schedule results than the existing algorithm.