Xin Li, Zhuzhong Qian, Ruiqing Chi, Bolei Zhang, Sanglu Lu
{"title":"Balancing Resource Utilization for Continuous Virtual Machine Requests in Clouds","authors":"Xin Li, Zhuzhong Qian, Ruiqing Chi, Bolei Zhang, Sanglu Lu","doi":"10.1109/IMIS.2012.72","DOIUrl":null,"url":null,"abstract":"The placement of virtual machines (VMs) on a cluster of physical machines (PMs) is a primary task in clouds. We can benefit a lot from appropriate placement policy, e.g. cost saving. In this paper, we raise a continuous virtual machine placement problem and propose an on-line algorithm to reduce the power consumption of clouds. Generic methods which deal with this problem with greedy manner will result in resource leak, a phenomenon of resource wasting. The direct consequence of this phenomenon is larger number of running PMs, which will cause higher power consumption. We prove it is an NP-complete problem to minimize the power consumption during the placement of VMs while the VM requests reach the clouds continuously. We propose a balanced algorithm with the principle of avoiding resource leak. The balanced algorithm handles the VM requests in real time and guarantees high resource utilization. The number of PMs and power consumption can be cut down as a result of high resource utilization. We evaluate the balanced algorithm via experiments with various simulations. Experimental results show that the balanced algorithm can reduce the number of running PMs effectively, so that, it has a significant efficiency on power saving.","PeriodicalId":290976,"journal":{"name":"2012 Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"297 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"43","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMIS.2012.72","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 43
Abstract
The placement of virtual machines (VMs) on a cluster of physical machines (PMs) is a primary task in clouds. We can benefit a lot from appropriate placement policy, e.g. cost saving. In this paper, we raise a continuous virtual machine placement problem and propose an on-line algorithm to reduce the power consumption of clouds. Generic methods which deal with this problem with greedy manner will result in resource leak, a phenomenon of resource wasting. The direct consequence of this phenomenon is larger number of running PMs, which will cause higher power consumption. We prove it is an NP-complete problem to minimize the power consumption during the placement of VMs while the VM requests reach the clouds continuously. We propose a balanced algorithm with the principle of avoiding resource leak. The balanced algorithm handles the VM requests in real time and guarantees high resource utilization. The number of PMs and power consumption can be cut down as a result of high resource utilization. We evaluate the balanced algorithm via experiments with various simulations. Experimental results show that the balanced algorithm can reduce the number of running PMs effectively, so that, it has a significant efficiency on power saving.