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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

3 篇 会议

馆藏范围

3 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3 篇 工学
- 2 篇 材料科学与工程（可...
- 2 篇 电气工程
- 1 篇 力学（可授工学、理...
- 1 篇 机械工程
- 1 篇 测绘科学与技术

主题

3 篇 out-tree task gr...
3 篇 task duplication
3 篇 task scheduling
2 篇 schedule length
2 篇 heterogeneous co...
1 篇 list scheduling
1 篇 parallel distrib...
1 篇 heterogeneity
1 篇 expected cost

机构

3 篇 naval univ engn ...

作者

2 篇 mei dan
2 篇 zhang jianjun
1 篇 wang tianhong
1 篇 wang yuzhuo
1 篇 qu yong
1 篇 zhang jian jun
1 篇 yang meini

语言

3 篇 英文

检索条件"主题词=Out-Tree task graph"

共 3 条记录，以下是1-10 订阅

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

详细简洁

排序：

Expected Cost based Greedy Scheduling Algorithm for out-tree task graphs

Expected Cost based Greedy Scheduling Algorithm for Out-Tree...

引用

International Conference on Mechatronics Engineering and Computing Technology (ICMECT)

作者： Zhang, Jianjun Wang, Tianhong Wang, Yuzhuo Naval Univ Engn Coll Sci Wuhan 430033 Peoples R China

ISBN: (纸本)9783038351153

Effective task scheduling is crucial for achieving high performance in heterogeneous computing environments. Whiling scheduling out-tree task graphs, many previous heterogeneity based heuristic algorithms usually require high scheduling costs and may not deliver good quality schedules with lower costs. Aiming at the characteristics of out-tree task graphs and the features of heterogeneous environments and adopting the strategy based on expected costs and task duplications, this paper proposes a greedy scheduling algorithm, which, at each scheduling step, tries to guarantee not to increase the schedule length, schedules the current task onto the used processor which minimizes its execution finish time;meanwhile, takes load balances into account to economize the use of processors. The comparative experimental results show that the proposed algorithm has higher scheduling efficiency and robust performance, which could produce better schedule which has shorter schedule length and less number of used processors.

关键词： out-tree task graph expected cost heterogeneous computing system task scheduling task duplication schedule length

来源：评论

学校读者我要写书评

暂无评论

A Heterogeneity Based Heuristic Algorithm for Scheduling out-tree task graphs 2

A Heterogeneity Based Heuristic Algorithm for Scheduling Out...

引用

2nd International Conference on Information Science and Control Engineering

作者： Zhang, Jianjun Mei, Dan Yang, Meini Naval Univ Engn Coll Sci Wuhan Peoples R China

ISBN: (纸本)9781467368506

Efficient task scheduling is a challenging aspect of achieving high performance in parallel programming. Aiming at the problem that many heuristics for this NP-hard problem were always developed based on homogeneous systems and ignored the heterogeneity of processors which are not met on real parallel systems, this paper presents a heuristic algorithm based on list and task duplication for scheduling out-tree task graphs in heterogeneous computing systems, named HHAS_OT, which tries to assign tasks to scheduled processors to balance the loads, minimize the number of processors used and improve the schedule performance without increasing the time complexity of the algorithm. The comparative study shows that our scheduling algorithm could achieve shorter schedule length while using less number of processors.

关键词： out-tree task graph task scheduling heterogeneity task duplication schedule length

来源：评论

学校读者我要写书评

暂无评论

A Heterogeneity Based Greedy Algorithm for Scheduling out-tree task graphs

A Heterogeneity Based Greedy Algorithm for Scheduling Out-Tr...

引用

2nd International Conference on Sensors, Measurement and Intelligent Materials (ICSMIM 2013)

作者： Zhang, Jian Jun Qu, Yong Mei, Dan Naval Univ Engn Coll Sci Wuhan 430033 Peoples R China

ISBN: (纸本)9783037859711

The scheduling of out-tree task graphs is one of the critical factors in implementing the compilers of parallel languages and improving the performance of parallel computing. When applied to out-tree task graphs, many previous classical heterogeneity based algorithms always ignored the economization on processors and the minimization of the schedule length, which led to low efficiency in real applications. This paper proposes a heterogeneity based greedy algorithm for scheduling out-tree task graphs, which is based on list and task duplication, tries to find the best point between balancing loads and shortening the schedule length and improves the schedule performance without increasing the time complexity of the algorithm. The comparative experimental results demonstrate that the proposed algorithm could achieve shorter schedule length while using less number of processors.

关键词： parallel distributed computing heterogeneous computing system task scheduling out-tree task graph task duplication list scheduling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共1页 << < 1 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：