首页    期刊浏览 2024年11月28日 星期四
登录注册

文章基本信息

  • 标题:Novel List Scheduling Strategies for Data Parallelism Task Graphs
  • 其他标题:Novel List Scheduling Strategies for Data Parallelism Task Graphs
  • 本地全文:下载
  • 作者:Yang Liu ; Lin Meng ; Ittetsu Taniguchi
  • 期刊名称:International Journal of Networking and Computing
  • 印刷版ISSN:2185-2847
  • 出版年度:2014
  • 卷号:4
  • 期号:2
  • 页码:279-290
  • 语种:English
  • 出版社:International Journal of Networking and Computing
  • 摘要: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.Â
  • 关键词:task scheduling; multicore; data parallelism
国家哲学社会科学文献中心版权所有