A genetic algorithm-based virtual machine scheduling algorithm for energy-efficient resource management in cloud computing

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Concurrency and Computation-Practice & Experience Pub Date : 2024-07-02 DOI:10.1002/cpe.8207
Feng Shi
{"title":"A genetic algorithm-based virtual machine scheduling algorithm for energy-efficient resource management in cloud computing","authors":"Feng Shi","doi":"10.1002/cpe.8207","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>To address the unbalanced resource load of a virtual machine cluster, the author proposes an energy-saving virtual machine scheduling algorithm based on resource management cloud computing technology. This article analyzes the current cloud computing and virtual machine scheduling research in the cloud computing environment. It discusses the concept, characteristics, classification, application scenarios, and key cloud computing technologies. A genetic algorithm is used to solve the problem of high energy consumption in the data center. The test results show that in the same original configuration scheme, the migration times based on the greedy algorithm adopted by GA2ND are about 1000, and the migration times of GA1ST are between 200 and 500. The GA2ND migration scheme requires fewer virtual machines. In the result analysis, the experiments compare the proposed algorithms—DVFS, IMC, GA1ST, and GA2ND—with a focus on energy consumption and virtual machine migration. Notably, DVFS serves as a reference for energy efficiency, IMC represents the proposed algorithm without genetic optimization, GA1ST denotes the genetic algorithm under a heterogeneous model, and GA2ND signifies the enhanced genetic algorithm introduced in this article. The comparison aims to assess the energy efficiency and virtual machine migration performance of each algorithm in the context of a simulated cloud computing environment. Therefore, the algorithm proposed in this article can effectively reduce energy consumption and avoid frequent migration of virtual machines.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 22","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8207","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

To address the unbalanced resource load of a virtual machine cluster, the author proposes an energy-saving virtual machine scheduling algorithm based on resource management cloud computing technology. This article analyzes the current cloud computing and virtual machine scheduling research in the cloud computing environment. It discusses the concept, characteristics, classification, application scenarios, and key cloud computing technologies. A genetic algorithm is used to solve the problem of high energy consumption in the data center. The test results show that in the same original configuration scheme, the migration times based on the greedy algorithm adopted by GA2ND are about 1000, and the migration times of GA1ST are between 200 and 500. The GA2ND migration scheme requires fewer virtual machines. In the result analysis, the experiments compare the proposed algorithms—DVFS, IMC, GA1ST, and GA2ND—with a focus on energy consumption and virtual machine migration. Notably, DVFS serves as a reference for energy efficiency, IMC represents the proposed algorithm without genetic optimization, GA1ST denotes the genetic algorithm under a heterogeneous model, and GA2ND signifies the enhanced genetic algorithm introduced in this article. The comparison aims to assess the energy efficiency and virtual machine migration performance of each algorithm in the context of a simulated cloud computing environment. Therefore, the algorithm proposed in this article can effectively reduce energy consumption and avoid frequent migration of virtual machines.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于遗传算法的虚拟机调度算法,用于云计算中的节能资源管理
摘要针对虚拟机集群资源负载不均衡的问题,作者提出了一种基于资源管理云计算技术的节能虚拟机调度算法。本文分析了当前云计算和云计算环境下的虚拟机调度研究。文章论述了云计算的概念、特点、分类、应用场景和关键技术。采用遗传算法解决数据中心的高能耗问题。测试结果表明,在相同的原始配置方案下,GA2ND采用的基于贪婪算法的迁移时间约为1000次,GA1ST的迁移时间在200至500次之间。GA2ND 迁移方案所需的虚拟机数量更少。在结果分析中,实验比较了所提出的算法--DVFS、IMC、GA1ST 和 GA2ND,重点是能耗和虚拟机迁移。值得注意的是,DVFS 作为能效的参考,IMC 代表不带遗传优化的拟议算法,GA1ST 表示异构模型下的遗传算法,GA2ND 表示本文引入的增强遗传算法。比较的目的是在模拟云计算环境下评估每种算法的能效和虚拟机迁移性能。因此,本文提出的算法可以有效降低能耗,避免虚拟机的频繁迁移。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
期刊最新文献
Issue Information Improving QoS in cloud resources scheduling using dynamic clustering algorithm and SM-CDC scheduling model Issue Information Issue Information Camellia oleifera trunks detection and identification based on improved YOLOv7
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1