咨询与建议

限定检索结果

文献类型

  • 4 篇 会议

馆藏范围

  • 4 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 3 篇 工学
    • 3 篇 计算机科学与技术...
    • 1 篇 信息与通信工程

主题

  • 4 篇 fork-join task g...
  • 4 篇 task duplication
  • 4 篇 optimal scheduli...

机构

  • 2 篇 huazhong univ sc...
  • 2 篇 department of co...

作者

  • 2 篇 shida yang
  • 2 篇 yang sd
  • 2 篇 tingyao jiang
  • 2 篇 li qh
  • 2 篇 youlin ruan
  • 2 篇 ruan yl
  • 2 篇 qinghua li
  • 1 篇 jiang ty
  • 1 篇 zhang jj

语言

  • 4 篇 英文
检索条件"主题词=Fork-Join Task Graph"
4 条 记 录,以下是1-10 订阅
排序:
A greedy algorithm for scheduling fork-join task graphs
A greedy algorithm for scheduling fork-join task graphs
收藏 引用
International Conference on Machine Learning and Cybernetics
作者: Zhang, JJ Ruan, YL Li, QH Yang, SD Huazhong Univ Sci & Technol Dept Comp Sci & Technol Wuhan 430074 Peoples R China
The goal of task scheduling algorithm is to allocate the tasks of a parallel program to processors in order to minimize the completion time of the program. This is known as an NP-Complete problem. Although a large num... 详细信息
来源: 评论
An optimal scheduling algorithm for fork-join task graphs
An optimal scheduling algorithm for fork-join task graphs
收藏 引用
4th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2003)
作者: Li, QH Ruan, YL Yang, SD Jiang, TY Huazhong Univ Sci & Technol Dept Comp Sci & Technol Wuhan 430074 Peoples R China
The task duplication based scheduling is a new approach to the scheduling problems. This is known as an NP-Complete problem. Although some algorithms are able to find an optimal schedule under certain conditions, they... 详细信息
来源: 评论
An Optimal Scheduling Algorithm for fork-join task graphs
An Optimal Scheduling Algorithm for Fork-Join Task Graphs
收藏 引用
The Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies
作者: Qinghua LI Youlin RUAN Shida YANG Tingyao JIANG Department of Computer Science and Technology HuaZhong University of Science and Technology
The task duplication based scheduling is a new approach to the scheduling *** is known as an NP-Complete *** some algorithms are able to find an optimal schedule under certain conditions,they ignored to economize proc... 详细信息
来源: 评论
An Optimal Scheduling Algorithm for fork-join task graphs
An Optimal Scheduling Algorithm for Fork-Join Task Graphs
收藏 引用
Proceedings of The Fourth International Conference on Parallel and Distribyted Computing,Applications and Technologies(第四届并行与分布式计算应用与技术国际会议)
作者: Qinghua LI Youlin RUAN Shida YANG Tingyao JIANG Department of Computer Science and Technology HuaZhong University of Science and Technology Wuhan 430074 China
The task duplication based scheduling is a new approach to the scheduling problems. This is known as an NP-Complete problem. Although some algorithms are able to find an optimal schedule under certain conditions, they... 详细信息
来源: 评论