网格上独立任务的加权平均时间Min-Min - Max-Min选择调度策略

S. Chauhan, R. Joshi
{"title":"网格上独立任务的加权平均时间Min-Min - Max-Min选择调度策略","authors":"S. Chauhan, R. Joshi","doi":"10.1109/IADCC.2010.5423047","DOIUrl":null,"url":null,"abstract":"With the emergence of Grid technologies, the problem of scheduling tasks in heterogeneous systems has been arousing attention. Task scheduling is a NP-complete problem[5] and it is more complicated under the Grid environment. To better use tremendous capabilities of Grid system, effective and efficient scheduling algorithms are needed. In this paper, we are presenting a new heuristic scheduling strategy for Independent tasks. The strategy is based on two traditional scheduling heuristics Min-Min and Max-Min. The strategy also considers the overall performance of machines to decide the scheduling sequence of tasks. We have evaluated our scheduling strategy within a grid simulator known as GridSim. We compared the results given by our strategy with the existing scheduling heuristics Min-Min and Max-Min and the results shows that our strategy outperforms in many cases than the existing ones.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"63","resultStr":"{\"title\":\"A weighted mean time Min-Min Max-Min selective scheduling strategy for independent tasks on Grid\",\"authors\":\"S. Chauhan, R. Joshi\",\"doi\":\"10.1109/IADCC.2010.5423047\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the emergence of Grid technologies, the problem of scheduling tasks in heterogeneous systems has been arousing attention. Task scheduling is a NP-complete problem[5] and it is more complicated under the Grid environment. To better use tremendous capabilities of Grid system, effective and efficient scheduling algorithms are needed. In this paper, we are presenting a new heuristic scheduling strategy for Independent tasks. The strategy is based on two traditional scheduling heuristics Min-Min and Max-Min. The strategy also considers the overall performance of machines to decide the scheduling sequence of tasks. We have evaluated our scheduling strategy within a grid simulator known as GridSim. We compared the results given by our strategy with the existing scheduling heuristics Min-Min and Max-Min and the results shows that our strategy outperforms in many cases than the existing ones.\",\"PeriodicalId\":249763,\"journal\":{\"name\":\"2010 IEEE 2nd International Advance Computing Conference (IACC)\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"63\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE 2nd International Advance Computing Conference (IACC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IADCC.2010.5423047\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 2nd International Advance Computing Conference (IACC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IADCC.2010.5423047","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 63

摘要

随着网格技术的出现,异构系统中的任务调度问题引起了人们的关注。任务调度是一个np完全问题[5],在网格环境下更加复杂。为了更好地利用网格系统的巨大能力,需要有效的调度算法。本文提出了一种新的启发式独立任务调度策略。该策略基于两种传统的调度启发式算法Min-Min和Max-Min。该策略还考虑了机器的整体性能来决定任务的调度顺序。我们在GridSim网格模拟器中评估了我们的调度策略。将该策略与现有的启发式算法Min-Min和Max-Min进行了比较,结果表明,该策略在许多情况下都优于现有的启发式算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A weighted mean time Min-Min Max-Min selective scheduling strategy for independent tasks on Grid
With the emergence of Grid technologies, the problem of scheduling tasks in heterogeneous systems has been arousing attention. Task scheduling is a NP-complete problem[5] and it is more complicated under the Grid environment. To better use tremendous capabilities of Grid system, effective and efficient scheduling algorithms are needed. In this paper, we are presenting a new heuristic scheduling strategy for Independent tasks. The strategy is based on two traditional scheduling heuristics Min-Min and Max-Min. The strategy also considers the overall performance of machines to decide the scheduling sequence of tasks. We have evaluated our scheduling strategy within a grid simulator known as GridSim. We compared the results given by our strategy with the existing scheduling heuristics Min-Min and Max-Min and the results shows that our strategy outperforms in many cases than the existing ones.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信