检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

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

ISBN: (纸本)0780378652

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 number of scheduling heuristics have been presented in the literature, most of them ignored to economize processors and minimize total completion time. In this paper, we present a greedy algorithm for scheduling fork-join task graph, which can generate better schedule results. The time complexity of the proposed algorithm is O(nu(2)), where nu is the number of tasks. Experimental comparisons with other algorithms show very favorable results.

关键词： optimal scheduling algorithm task duplication fork-join task graph

来源：评论

学校读者我要写书评

暂无评论

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

ISBN: (纸本)0780378407

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 ignored to economize processors and minimize the total completion time. In this paper, we presents a task Duplication based Balance Scheduling (TDBS) algorithm which can schedule a class of fork-join task graph with a complexity of of O(\V\(2)), where \V\ is the number of tasks. The proposed algorithm generates an optimal schedule with high speedup and efficiency. Simulation results showed that our algorithm has better scheduling length, less completion time and less number of processors than any of compared algorithms.

关键词： optimal scheduling algorithm task duplication fork-join task graph

来源：评论

学校读者我要写书评

暂无评论

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 processors and minimize the total completion *** this paper,we presents a task Duplication based Balance Scheduling (TDBS) algorithm which can schedule a class of fork-join task graph with a complexity of of 0(|V|), where |V| is the number of *** proposed algorithm generates an optimal schedule with high speedup and *** results showed that our algorithm has better scheduling length,less completion time and less number of processors than any of compared algorithms.

关键词： Optimal Scheduling Algorithm task Duplication fork-join task graph

来源：评论

学校读者我要写书评

暂无评论

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

ISBN: (纸本)0780378407

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 ignored to economize processors and minimize the total completion time. In this paper, we presents a task Duplication based Balance Scheduling (TDBS) algorithm which can schedule a class of fork-join task graph with a complexity of of O(| V|2),where |V| is the number of tasks. The proposed algorithm generates an optimal schedule with high speedup and efficiency. Simulation results showed that our algorithm has better scheduling length, less completion time and less number of processors than any of compared algorithms.

关键词： Optimal Scheduling Algorithm task Duplication fork-join task graph

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共1页 << < 1 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：