Makhlouf Hadji, N. Djenane, R. Aoudjit, S. Bouzefrane
{"title":"A New Scalable and Energy Efficient Algorithm for VMs Reassignment in Cloud Data Centers","authors":"Makhlouf Hadji, N. Djenane, R. Aoudjit, S. Bouzefrane","doi":"10.1109/W-FiCloud.2016.69","DOIUrl":null,"url":null,"abstract":"To improve resource utilization in Cloud Data Centers and in order to reduce energy consumption at the same time, reassignment of services is required and leads to efficient operational costs. This paper presents a new and scalable algorithm based on b-matching theory to judiciously replace resources (considered as Virtual Machines in our work) according to energy consumption constraints. Our algorithm is benchmarked by an exact approach based on an Integer Linear Program (ILP) formulation of the Bin-Packing problem. The b-Matching algorithm allows to find near-optimal solutions and scale for large problem instances.","PeriodicalId":441441,"journal":{"name":"2016 IEEE 4th International Conference on Future Internet of Things and Cloud Workshops (FiCloudW)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 4th International Conference on Future Internet of Things and Cloud Workshops (FiCloudW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/W-FiCloud.2016.69","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
To improve resource utilization in Cloud Data Centers and in order to reduce energy consumption at the same time, reassignment of services is required and leads to efficient operational costs. This paper presents a new and scalable algorithm based on b-matching theory to judiciously replace resources (considered as Virtual Machines in our work) according to energy consumption constraints. Our algorithm is benchmarked by an exact approach based on an Integer Linear Program (ILP) formulation of the Bin-Packing problem. The b-Matching algorithm allows to find near-optimal solutions and scale for large problem instances.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
