针对云计算环境下时间成本权衡调度问题的服务质量任务调度算法

Danlami Gabi, A. Ismail, A. Zainal, Z. Zakaria
{"title":"针对云计算环境下时间成本权衡调度问题的服务质量任务调度算法","authors":"Danlami Gabi, A. Ismail, A. Zainal, Z. Zakaria","doi":"10.1504/IJISTA.2019.10022618","DOIUrl":null,"url":null,"abstract":"In cloud computing environment, managing trade-offs between time and cost when executing large-scale tasks to guarantee customers minimum running time and cost of computation is not always feasible. Metaheuristics scheduling algorithms are considered as potential solutions but however, exhibit local trapping and imbalance between its global and local search. In this study, a multi-objective task scheduling model is first developed upon which a dynamic multi-objective orthogonal Taguchi-based cat swarm optimisation (dMOOTC) task scheduling algorithm is proposed to solve the model. In the developed dMOOTC algorithm, the Taguchi orthogonal approach and Pareto-optimisation strategy are used to reduced local trapping and balances between the global and local search which possibly increases its speed of convergence. Thirty independent simulation runs were conducted on CloudSim simulator tool. The results of the simulation showed that the dMOOTC scheduling algorithm showed a remarkable performance in minimising the time and cost compared to the benchmarked algorithms.","PeriodicalId":420808,"journal":{"name":"Int. J. Intell. Syst. Technol. Appl.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Quality of service task scheduling algorithm for time-cost trade off scheduling problem in cloud computing environment\",\"authors\":\"Danlami Gabi, A. Ismail, A. Zainal, Z. Zakaria\",\"doi\":\"10.1504/IJISTA.2019.10022618\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In cloud computing environment, managing trade-offs between time and cost when executing large-scale tasks to guarantee customers minimum running time and cost of computation is not always feasible. Metaheuristics scheduling algorithms are considered as potential solutions but however, exhibit local trapping and imbalance between its global and local search. In this study, a multi-objective task scheduling model is first developed upon which a dynamic multi-objective orthogonal Taguchi-based cat swarm optimisation (dMOOTC) task scheduling algorithm is proposed to solve the model. In the developed dMOOTC algorithm, the Taguchi orthogonal approach and Pareto-optimisation strategy are used to reduced local trapping and balances between the global and local search which possibly increases its speed of convergence. Thirty independent simulation runs were conducted on CloudSim simulator tool. The results of the simulation showed that the dMOOTC scheduling algorithm showed a remarkable performance in minimising the time and cost compared to the benchmarked algorithms.\",\"PeriodicalId\":420808,\"journal\":{\"name\":\"Int. J. Intell. Syst. Technol. Appl.\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Intell. Syst. Technol. Appl.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJISTA.2019.10022618\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Intell. Syst. Technol. Appl.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJISTA.2019.10022618","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

在云计算环境中,在执行大规模任务时管理时间和成本之间的权衡,以保证客户最小的运行时间和计算成本,并不总是可行的。元启发式调度算法被认为是一种潜在的解决方案,但其全局搜索和局部搜索之间存在局部陷阱和不平衡。本文首先建立了一个多目标任务调度模型,并在此基础上提出了一种基于田口正交的动态多目标猫群优化(dMOOTC)任务调度算法。提出的dMOOTC算法采用田口正交法和帕累托优化策略,减少了局部捕获,平衡了全局和局部搜索,提高了收敛速度。在CloudSim模拟器工具上进行了30次独立的模拟运行。仿真结果表明,与基准算法相比,dMOOTC调度算法在最小化时间和成本方面表现出显著的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Quality of service task scheduling algorithm for time-cost trade off scheduling problem in cloud computing environment
In cloud computing environment, managing trade-offs between time and cost when executing large-scale tasks to guarantee customers minimum running time and cost of computation is not always feasible. Metaheuristics scheduling algorithms are considered as potential solutions but however, exhibit local trapping and imbalance between its global and local search. In this study, a multi-objective task scheduling model is first developed upon which a dynamic multi-objective orthogonal Taguchi-based cat swarm optimisation (dMOOTC) task scheduling algorithm is proposed to solve the model. In the developed dMOOTC algorithm, the Taguchi orthogonal approach and Pareto-optimisation strategy are used to reduced local trapping and balances between the global and local search which possibly increases its speed of convergence. Thirty independent simulation runs were conducted on CloudSim simulator tool. The results of the simulation showed that the dMOOTC scheduling algorithm showed a remarkable performance in minimising the time and cost compared to the benchmarked algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信