OD: A General Resource Scheduling Algorithm for Computational Grid*

Tao Wang, Xingshe Zhou, Qiu-rang Liu, Zhiyi Yang, Zhao-feng Yang
{"title":"OD: A General Resource Scheduling Algorithm for Computational Grid*","authors":"Tao Wang, Xingshe Zhou, Qiu-rang Liu, Zhiyi Yang, Zhao-feng Yang","doi":"10.1109/IMSCCS.2006.93","DOIUrl":null,"url":null,"abstract":"Task scheduling is a critical design issue of distributed computing. The emerging grid computing infrastructure consists of heterogeneous resource in widely distributed autonomous domains, which makes task scheduling even more challenging. In this paper, a general resource scheduling algorithm for computational grid, OD (on-demand) is present. According to the computational grid job's personal resource requirements, the different importance of these requirements and the system load of the computational grid nodes, OD chooses an appropriate node for computational grid job from the candidates finally. The experiments show the performance improvement for applications and achieve better load balance by this algorithm","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMSCCS.2006.93","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Task scheduling is a critical design issue of distributed computing. The emerging grid computing infrastructure consists of heterogeneous resource in widely distributed autonomous domains, which makes task scheduling even more challenging. In this paper, a general resource scheduling algorithm for computational grid, OD (on-demand) is present. According to the computational grid job's personal resource requirements, the different importance of these requirements and the system load of the computational grid nodes, OD chooses an appropriate node for computational grid job from the candidates finally. The experiments show the performance improvement for applications and achieve better load balance by this algorithm
一种通用的计算网格资源调度算法*
任务调度是分布式计算的一个关键设计问题。新兴的网格计算基础设施由分布广泛的自治域中的异构资源组成,这使得任务调度更具挑战性。本文提出了一种通用的计算网格资源调度算法,即OD (on-demand)。根据计算网格作业的个人资源需求、这些需求的不同重要性以及计算网格节点的系统负载,OD最终从候选节点中选择适合计算网格作业的节点。实验表明,该算法提高了应用程序的性能,实现了较好的负载均衡
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信