International Journal of Networking and Computing
Online ISSN : 2185-2847
Print ISSN : 2185-2839
Special Issue on the First International Symposium on Computing and Networking
Novel List Scheduling Strategies for Data Parallelism Task Graphs
Yang LiuLin MengIttetsu TaniguchiHiroyuki Tomiyama
Author information
JOURNALS FREE ACCESS

2014 Volume 4 Issue 2 Pages 279-290

Details
Abstract

This paper studies task scheduling algorithms which schedule a set of tasks on multiple cores so that the total scheduling length is minimized. Most of the algorithms developed in the past assume that a task is executed on a single core. Unlike the previous algorithms, the algorithms studied in this paper allow a task to be executed on multiple cores. This paper proposes six algorithms. All of the six algorithms are based on list scheduling, but the strategy for priority assignment is different. In our experiments, the six algorithms as well as an integer linear programming method are evaluated.

Information related to the author
© 2014 International Journal of Networking and Computing
Previous article Next article
feedback
Top