网格环境下任务调度的有效机制研究

Huyin Zhang, Chanle Wu, Qing Xiong, Libing Wu, Gang Ye
{"title":"网格环境下任务调度的有效机制研究","authors":"Huyin Zhang, Chanle Wu, Qing Xiong, Libing Wu, Gang Ye","doi":"10.1109/GCC.2006.79","DOIUrl":null,"url":null,"abstract":"This paper gives a definition of the communication overhead among nodes in task scheduling and resource management in grid environment, presents rules of building QoS routing tree based on the QoS routing algorithm, proposes grid heap-sort algorithm and QoS routing algorithm, and designs a scheme of grid task scheduling with the help of them. The results of its correlative experiment indicate that this design can guarantee quality of service in grid better","PeriodicalId":280249,"journal":{"name":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Research on an Effective Mechanism of Task-scheduling in Grid Environment\",\"authors\":\"Huyin Zhang, Chanle Wu, Qing Xiong, Libing Wu, Gang Ye\",\"doi\":\"10.1109/GCC.2006.79\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper gives a definition of the communication overhead among nodes in task scheduling and resource management in grid environment, presents rules of building QoS routing tree based on the QoS routing algorithm, proposes grid heap-sort algorithm and QoS routing algorithm, and designs a scheme of grid task scheduling with the help of them. The results of its correlative experiment indicate that this design can guarantee quality of service in grid better\",\"PeriodicalId\":280249,\"journal\":{\"name\":\"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GCC.2006.79\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Fifth International Conference on Grid and Cooperative Computing (GCC'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GCC.2006.79","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

摘要

给出了网格环境下任务调度和资源管理中节点间通信开销的定义,给出了基于QoS路由算法的QoS路由树构建规则,提出了网格堆排序算法和QoS路由算法,并利用它们设计了网格任务调度方案。相关实验结果表明,该设计能较好地保证电网的服务质量
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Research on an Effective Mechanism of Task-scheduling in Grid Environment
This paper gives a definition of the communication overhead among nodes in task scheduling and resource management in grid environment, presents rules of building QoS routing tree based on the QoS routing algorithm, proposes grid heap-sort algorithm and QoS routing algorithm, and designs a scheme of grid task scheduling with the help of them. The results of its correlative experiment indicate that this design can guarantee quality of service in grid better
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信