Power and Resource-Aware VM Placement in Cloud Environment

Neha Garg, Damanpreet Singh, Major Singh Goraya
{"title":"Power and Resource-Aware VM Placement in Cloud Environment","authors":"Neha Garg, Damanpreet Singh, Major Singh Goraya","doi":"10.1109/IADCC.2018.8692118","DOIUrl":null,"url":null,"abstract":"Cloud computing provides various services to the cloud consumers based on demand and pay per use basis. To improve the system performance (such as energy efficiency, resource utilization (RU), etc.) more than one virtual machine (VM) can be deployed on a server. Efficient VM placement policy increases the system performance by utilizing all the computing resources at their maximum threshold limit and reduce the probability to become a server overloaded/underloaded. Overloaded/underloaded servers consume more energy and increase the number of VM migration in comparison to the server which is in a normal state. In this paper, Energy and Resource-Aware VM Placement (ERAP) algorithm is presented. This algorithm considers both, energy as well as central processing unit (CPU) utilization to deploy the VMs on the servers. CloudSim toolkit is used to analyze the behavior of the ERAP algorithm. The effectiveness of the ERAP algorithm is tested on real workload traces of Planet Lab. Results show that ERAP algorithm performs better in comparison to the existing algorithm on the account of the number of VM migrations, total energy consumption, number of servers shutdowns, and average service level agreement (SLA) violation rate. Results show that on average 13.12% energy consumption is minimized in contrast to the existing algorithm.","PeriodicalId":365713,"journal":{"name":"2018 IEEE 8th International Advance Computing Conference (IACC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 8th International Advance Computing Conference (IACC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IADCC.2018.8692118","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

Cloud computing provides various services to the cloud consumers based on demand and pay per use basis. To improve the system performance (such as energy efficiency, resource utilization (RU), etc.) more than one virtual machine (VM) can be deployed on a server. Efficient VM placement policy increases the system performance by utilizing all the computing resources at their maximum threshold limit and reduce the probability to become a server overloaded/underloaded. Overloaded/underloaded servers consume more energy and increase the number of VM migration in comparison to the server which is in a normal state. In this paper, Energy and Resource-Aware VM Placement (ERAP) algorithm is presented. This algorithm considers both, energy as well as central processing unit (CPU) utilization to deploy the VMs on the servers. CloudSim toolkit is used to analyze the behavior of the ERAP algorithm. The effectiveness of the ERAP algorithm is tested on real workload traces of Planet Lab. Results show that ERAP algorithm performs better in comparison to the existing algorithm on the account of the number of VM migrations, total energy consumption, number of servers shutdowns, and average service level agreement (SLA) violation rate. Results show that on average 13.12% energy consumption is minimized in contrast to the existing algorithm.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
云环境中的电源和资源感知虚拟机放置
云计算根据需求和按使用付费的方式向云消费者提供各种服务。为了提高系统的性能(如能效、RU等),一台服务器上可以部署多个虚拟机。高效的虚拟机放置策略通过最大限度地利用所有计算资源来提高系统性能,降低服务器过载/欠载的概率。与正常状态的服务器相比,过载/负载不足的服务器消耗更多的能量,并且增加了虚拟机迁移的数量。提出了一种基于能量和资源感知的虚拟机布局算法。该算法同时考虑了能源和中央处理器(CPU)利用率,以便在服务器上部署虚拟机。CloudSim工具包用于分析ERAP算法的行为。在Planet Lab的实际工作负载轨迹上验证了ERAP算法的有效性。结果表明,ERAP算法在虚拟机迁移次数、总能耗、服务器关闭次数和平均违反SLA (service level agreement)率等方面都优于现有算法。结果表明,与现有算法相比,该算法的平均能耗降低了13.12%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Discovering Motifs in DNA Sequences: A Suffix Tree Based Approach Prediction Model for Automated Leaf Disease Detection & Analysis Blind navigation using ambient crowd analysis HUPM: Efficient High Utility Pattern Mining Algorithm for E-Business Algorithm to Quantify the Low and High Resolution HLA Matching in Renal Transplantation
×
引用
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