基于粒子群优化的云计算资源调度策略

Hai-Hao Li, Yu-Wen Fu, Zhi-hui Zhan, Jingjing Li
{"title":"基于粒子群优化的云计算资源调度策略","authors":"Hai-Hao Li, Yu-Wen Fu, Zhi-hui Zhan, Jingjing Li","doi":"10.1109/CEC.2015.7256982","DOIUrl":null,"url":null,"abstract":"Cloud computing offers unprecedented capacity to execute large-scale workflows in the “era of big data”. In 2014, a cost-minimization and deadline-constrained workflow scheduling (CMDCWS) model is firstly proposed by Rodriguez and Buyya, which is applicable for the business need of cloud computing that a workflow task should be finished by minimizing the execute cost within a deadline constraint. As scheduling cloud computing resources for workflow is an NP-hard problem, Rodriguez and Buyya proposed to use particle swarm optimization (PSO) to solve the CMDCWS problem. In traditional PSO for CMDCWS, each dimension in the particle position stands for each task and the value of the corresponding dimension stands for the index of the cloud resource that executes this task. However, this may have drawback because the value of each dimension does not relate to the resource characteristic but is only a meaningless index number. Therefore the learning behaviors among the particles do not make sense because learning from index number may not lead to better position. In this paper, we present a resource renumber strategy to encode the particle position and design a renumber PSO (RNPSO) for CMDCWS. In RNPSO, all the resources are re-ordered and re-numbered according to their computational ability, i.e., the cost per unit time. By this, the values of particle position can make sense and the positions difference between the well-performed and poorly-performed particles can guide poorly-performed particle to promising region. We conduct experiments on test cases with small, middle, and large scales to compare the performance of PSO and RNPSO. The results show that the resource renumber strategy is promising for enhancing the PSO performance.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"37","resultStr":"{\"title\":\"Renumber strategy enhanced particle swarm optimization for cloud computing resource scheduling\",\"authors\":\"Hai-Hao Li, Yu-Wen Fu, Zhi-hui Zhan, Jingjing Li\",\"doi\":\"10.1109/CEC.2015.7256982\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cloud computing offers unprecedented capacity to execute large-scale workflows in the “era of big data”. In 2014, a cost-minimization and deadline-constrained workflow scheduling (CMDCWS) model is firstly proposed by Rodriguez and Buyya, which is applicable for the business need of cloud computing that a workflow task should be finished by minimizing the execute cost within a deadline constraint. As scheduling cloud computing resources for workflow is an NP-hard problem, Rodriguez and Buyya proposed to use particle swarm optimization (PSO) to solve the CMDCWS problem. In traditional PSO for CMDCWS, each dimension in the particle position stands for each task and the value of the corresponding dimension stands for the index of the cloud resource that executes this task. However, this may have drawback because the value of each dimension does not relate to the resource characteristic but is only a meaningless index number. Therefore the learning behaviors among the particles do not make sense because learning from index number may not lead to better position. In this paper, we present a resource renumber strategy to encode the particle position and design a renumber PSO (RNPSO) for CMDCWS. In RNPSO, all the resources are re-ordered and re-numbered according to their computational ability, i.e., the cost per unit time. By this, the values of particle position can make sense and the positions difference between the well-performed and poorly-performed particles can guide poorly-performed particle to promising region. We conduct experiments on test cases with small, middle, and large scales to compare the performance of PSO and RNPSO. The results show that the resource renumber strategy is promising for enhancing the PSO performance.\",\"PeriodicalId\":403666,\"journal\":{\"name\":\"2015 IEEE Congress on Evolutionary Computation (CEC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"37\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE Congress on Evolutionary Computation (CEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2015.7256982\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Congress on Evolutionary Computation (CEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2015.7256982","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 37

摘要

在“大数据时代”,云计算为执行大规模工作流提供了前所未有的能力。2014年,Rodriguez和Buyya首次提出了成本最小化和期限约束工作流调度(CMDCWS)模型,该模型适用于云计算的业务需求,即在期限约束下最小化执行成本来完成工作流任务。由于工作流的云计算资源调度是一个np困难问题,Rodriguez和Buyya提出使用粒子群优化(PSO)来解决CMDCWS问题。在传统的CMDCWS粒子群算法中,粒子位置的每个维度代表每个任务,对应维度的值代表执行该任务的云资源的索引。然而,这可能有缺点,因为每个维度的值与资源特征无关,而只是一个无意义的索引号。因此,粒子之间的学习行为是没有意义的,因为从索引数学习可能不会导致更好的位置。本文提出了一种资源重数策略来编码粒子位置,并设计了一种CMDCWS的重数粒子群(RNPSO)。在RNPSO中,根据资源的计算能力,即单位时间的成本,对所有资源进行重新排序和编号。这样,粒子的位置值就有了意义,表现良好和表现较差的粒子之间的位置差可以引导表现较差的粒子到有希望的区域。我们对小、中、大尺度的测试用例进行了实验,比较了PSO和RNPSO的性能。结果表明,资源数量策略是提高粒子群算法性能的有效方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Renumber strategy enhanced particle swarm optimization for cloud computing resource scheduling
Cloud computing offers unprecedented capacity to execute large-scale workflows in the “era of big data”. In 2014, a cost-minimization and deadline-constrained workflow scheduling (CMDCWS) model is firstly proposed by Rodriguez and Buyya, which is applicable for the business need of cloud computing that a workflow task should be finished by minimizing the execute cost within a deadline constraint. As scheduling cloud computing resources for workflow is an NP-hard problem, Rodriguez and Buyya proposed to use particle swarm optimization (PSO) to solve the CMDCWS problem. In traditional PSO for CMDCWS, each dimension in the particle position stands for each task and the value of the corresponding dimension stands for the index of the cloud resource that executes this task. However, this may have drawback because the value of each dimension does not relate to the resource characteristic but is only a meaningless index number. Therefore the learning behaviors among the particles do not make sense because learning from index number may not lead to better position. In this paper, we present a resource renumber strategy to encode the particle position and design a renumber PSO (RNPSO) for CMDCWS. In RNPSO, all the resources are re-ordered and re-numbered according to their computational ability, i.e., the cost per unit time. By this, the values of particle position can make sense and the positions difference between the well-performed and poorly-performed particles can guide poorly-performed particle to promising region. We conduct experiments on test cases with small, middle, and large scales to compare the performance of PSO and RNPSO. The results show that the resource renumber strategy is promising for enhancing the PSO performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信