Risk Aware Provisioning and Resource Aggregation Based Consolidation of Virtual Machines

Kishaloy Halder, U. Bellur, Purushottam Kulkarni
{"title":"Risk Aware Provisioning and Resource Aggregation Based Consolidation of Virtual Machines","authors":"Kishaloy Halder, U. Bellur, Purushottam Kulkarni","doi":"10.1109/CLOUD.2012.86","DOIUrl":null,"url":null,"abstract":"Server consolidation has emerged as an important technique to save on energy costs in virtualized datacenters. The issue of instantiation of a given set of Virtual Machines (VMs) on a set of Physical Machines (PMs) can be thought of as consisting of a provisioning step where we determine the amount of resources to be allocated to a VM and a placement step which decides which VMs can be placed together on a physical machines thereby allocating VMs to PMs. In this paper, we introduce a provisioning scheme which takes into account acceptable intensity of violation of provisioned resources. In addition we identify a serious shortcoming of existing placement schemes that correct in our correlation aware placement scheme. We consider correlation among aggregated resource demands of VMs while finding the VM-PM mapping. Experimental results reveal that our approach leads to a significant amount of reduction in the number of servers (up to 32% in our settings) required to host 1000 VMs and thus enables us to turn off unnecessary servers. It achieves this by packing VMs more tightly by correlating resource requirements across the entire set of VMs to be placed. We present a comprehensive set of experimental results comparing our scheme with the existing provisioning and placement schemes.","PeriodicalId":214084,"journal":{"name":"2012 IEEE Fifth International Conference on Cloud Computing","volume":"82 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Fifth International Conference on Cloud Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CLOUD.2012.86","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 33

Abstract

Server consolidation has emerged as an important technique to save on energy costs in virtualized datacenters. The issue of instantiation of a given set of Virtual Machines (VMs) on a set of Physical Machines (PMs) can be thought of as consisting of a provisioning step where we determine the amount of resources to be allocated to a VM and a placement step which decides which VMs can be placed together on a physical machines thereby allocating VMs to PMs. In this paper, we introduce a provisioning scheme which takes into account acceptable intensity of violation of provisioned resources. In addition we identify a serious shortcoming of existing placement schemes that correct in our correlation aware placement scheme. We consider correlation among aggregated resource demands of VMs while finding the VM-PM mapping. Experimental results reveal that our approach leads to a significant amount of reduction in the number of servers (up to 32% in our settings) required to host 1000 VMs and thus enables us to turn off unnecessary servers. It achieves this by packing VMs more tightly by correlating resource requirements across the entire set of VMs to be placed. We present a comprehensive set of experimental results comparing our scheme with the existing provisioning and placement schemes.
基于虚拟机整合的风险感知配置和资源聚合
服务器整合已经成为虚拟化数据中心中节省能源成本的一项重要技术。在一组物理机(pm)上实例化一组给定的虚拟机(VM)的问题可以被认为是由两个步骤组成的,一个是供应步骤,我们决定分配给虚拟机的资源数量,另一个是放置步骤,决定哪些虚拟机可以一起放在物理机上,从而将虚拟机分配给pm。在本文中,我们引入了一种考虑可接受的资源违反强度的供应方案。此外,我们还发现了现有放置方案的一个严重缺点,这些缺点在我们的相关性感知放置方案中得到了纠正。在寻找VM-PM映射时,我们考虑了vm的聚合资源需求之间的相关性。实验结果表明,我们的方法导致托管1000个vm所需的服务器数量显著减少(在我们的设置中最多减少32%),从而使我们能够关闭不必要的服务器。它通过在整个要放置的虚拟机集合中关联资源需求来更紧密地打包虚拟机来实现这一点。我们给出了一组全面的实验结果,将我们的方案与现有的供应和安置方案进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信