基于改进粒子群算法和遗传算法的云计算虚拟机调度比较研究

S. Supreeth, Kirankumari Patil, S. Patil, S. Rohith
{"title":"基于改进粒子群算法和遗传算法的云计算虚拟机调度比较研究","authors":"S. Supreeth, Kirankumari Patil, S. Patil, S. Rohith","doi":"10.1109/ICDSIS55133.2022.9915907","DOIUrl":null,"url":null,"abstract":"The Users can access Cloud services anytime and from any location, depending on their needs. In a cloud platform, data of a vast amount is transferred from the user to the server and vice-versa. Whenever the VM Scheduling takes longer than expected, or the selected VM does not exist in the datacenter may utilize more Energy consumption and SLA (Service Level Agreement) violations with more VM Migrations. Because the VM is the primary element in the Cloud Environment, the VM’s assignment must be done correctly; resources must be utilized effectively, and no violations must occur with less VM Migrations. Two approaches are implemented for the comparison i.e., Modified Particle Swarm optimization (MPSO), and Genetic Algorithm (GA). The MPSO resulted better than GA by 6.0S%, LR-MMT by 32.2%, and GA at 27.81% compared to Local Regression-Minimum Migration Time (LR-MMT) in energy consumption. The MPSO resulted better than GA by 48.39%, LR-MMT by 91.6%, and GA by S3.73% compared to LR-MMT in VM migrations. The MPSO resulted better than GA by 5%, Local RegressionRandom Selection (LR-RS) by 71.21%, and GA resulted in 67.21% compared to Local Regression-Maximum Correlation (LR-MC) in SLA Violation. Therefore, the acquired results indicated that the suggested approach converges to optimal solutions with higher quality than existing algorithms compared to the QoS parameters.","PeriodicalId":178360,"journal":{"name":"2022 IEEE International Conference on Data Science and Information System (ICDSIS)","volume":"2003 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Comparative approach for VM Scheduling using Modified Particle Swarm Optimization and Genetic Algorithm in Cloud Computing\",\"authors\":\"S. Supreeth, Kirankumari Patil, S. Patil, S. Rohith\",\"doi\":\"10.1109/ICDSIS55133.2022.9915907\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Users can access Cloud services anytime and from any location, depending on their needs. In a cloud platform, data of a vast amount is transferred from the user to the server and vice-versa. Whenever the VM Scheduling takes longer than expected, or the selected VM does not exist in the datacenter may utilize more Energy consumption and SLA (Service Level Agreement) violations with more VM Migrations. Because the VM is the primary element in the Cloud Environment, the VM’s assignment must be done correctly; resources must be utilized effectively, and no violations must occur with less VM Migrations. Two approaches are implemented for the comparison i.e., Modified Particle Swarm optimization (MPSO), and Genetic Algorithm (GA). The MPSO resulted better than GA by 6.0S%, LR-MMT by 32.2%, and GA at 27.81% compared to Local Regression-Minimum Migration Time (LR-MMT) in energy consumption. The MPSO resulted better than GA by 48.39%, LR-MMT by 91.6%, and GA by S3.73% compared to LR-MMT in VM migrations. The MPSO resulted better than GA by 5%, Local RegressionRandom Selection (LR-RS) by 71.21%, and GA resulted in 67.21% compared to Local Regression-Maximum Correlation (LR-MC) in SLA Violation. Therefore, the acquired results indicated that the suggested approach converges to optimal solutions with higher quality than existing algorithms compared to the QoS parameters.\",\"PeriodicalId\":178360,\"journal\":{\"name\":\"2022 IEEE International Conference on Data Science and Information System (ICDSIS)\",\"volume\":\"2003 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-07-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE International Conference on Data Science and Information System (ICDSIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDSIS55133.2022.9915907\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Data Science and Information System (ICDSIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDSIS55133.2022.9915907","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

用户可以根据自己的需要随时随地访问云服务。在云平台中,大量的数据从用户传输到服务器,反之亦然。每当虚拟机调度时间超过预期,或者所选虚拟机不存在于数据中心时,可能会导致更多的虚拟机迁移,从而导致更多的能耗和SLA(服务水平协议)违规。因为VM是云环境中的主要元素,所以VM的分配必须正确完成;必须有效地利用资源,减少虚拟机迁移,不发生违规。采用改进粒子群算法(MPSO)和遗传算法(GA)进行比较。与局部回归最小迁移时间(LR-MMT)相比,MPSO的能耗比GA高6.0%,比LR-MMT高32.2%,比GA高27.81%。在VM迁移中,MPSO比GA好48.39%,比LR-MMT好91.6%,比GA好S3.73%。MPSO法比GA法在SLA违反方面的效果好5%,比Local regression - random Selection (LR-RS)的效果好71.21%,比Local Regression-Maximum Correlation (LR-MC)的效果好67.21%。因此,所得结果表明,相对于QoS参数,所提方法收敛到的最优解质量高于现有算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Comparative approach for VM Scheduling using Modified Particle Swarm Optimization and Genetic Algorithm in Cloud Computing
The Users can access Cloud services anytime and from any location, depending on their needs. In a cloud platform, data of a vast amount is transferred from the user to the server and vice-versa. Whenever the VM Scheduling takes longer than expected, or the selected VM does not exist in the datacenter may utilize more Energy consumption and SLA (Service Level Agreement) violations with more VM Migrations. Because the VM is the primary element in the Cloud Environment, the VM’s assignment must be done correctly; resources must be utilized effectively, and no violations must occur with less VM Migrations. Two approaches are implemented for the comparison i.e., Modified Particle Swarm optimization (MPSO), and Genetic Algorithm (GA). The MPSO resulted better than GA by 6.0S%, LR-MMT by 32.2%, and GA at 27.81% compared to Local Regression-Minimum Migration Time (LR-MMT) in energy consumption. The MPSO resulted better than GA by 48.39%, LR-MMT by 91.6%, and GA by S3.73% compared to LR-MMT in VM migrations. The MPSO resulted better than GA by 5%, Local RegressionRandom Selection (LR-RS) by 71.21%, and GA resulted in 67.21% compared to Local Regression-Maximum Correlation (LR-MC) in SLA Violation. Therefore, the acquired results indicated that the suggested approach converges to optimal solutions with higher quality than existing algorithms compared to the QoS parameters.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信