云数据中心虚拟机重新分配的一种可扩展节能新算法

2016 IEEE 4th International Conference on Future Internet of Things and Cloud Workshops (FiCloudW) Pub Date : 2016-08-01 DOI:10.1109/W-FiCloud.2016.69

Makhlouf Hadji, N. Djenane, R. Aoudjit, S. Bouzefrane

{"title":"云数据中心虚拟机重新分配的一种可扩展节能新算法","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":"{\"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}","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

摘要

为了提高云数据中心的资源利用率，同时降低能源消耗，需要对服务进行重新分配，从而降低运营成本。本文提出了一种新的基于b匹配理论的可扩展算法，可以根据能耗约束明智地替换资源(在我们的工作中称为虚拟机)。我们的算法是基于整数线性规划(ILP)的装箱问题的精确方法的基准。b-Matching算法允许找到接近最优的解决方案，并扩展到大型问题实例。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A New Scalable and Energy Efficient Algorithm for VMs Reassignment in Cloud Data Centers

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 IEEE 4th International Conference on Future Internet of Things and Cloud Workshops (FiCloudW)

自引率

0.00%

发文量