首页> 外文会议>IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing >Energy-Saving Virtual Machine Placement in Cloud Data Centers
【24h】

Energy-Saving Virtual Machine Placement in Cloud Data Centers

机译:云数据中心的节能虚拟机放置

获取原文

摘要

In cloud data centers, different mapping relationships between virtual machines (VMs) and physical machines (PMs) cause different resource utilization, therefore, how to place VMs on PMs to improve resource utilization and reduce energy consumption is one of the major concerns for cloud providers. The existing VM placement schemes are to optimize physical server resources utilization or network resources utilization, but few of them focuses on optimizing multiple resources utilization simultaneously. To address the issue, this paper proposes a VM placement scheme meeting multiple resource constraints, such as the physical server size (CPU, memory, storage, bandwidth, etc.) and network link capacity to improve resource utilization and reduce both the number of active physical servers and network elements so as to finally reduce energy consumption. Since VM placement problem is abstracted as a combination of bin packing problem and quadratic assignment problem, which is also known as a classic combinatorial optimization and NP-hard problem, we design a novel greedy algorithm by combining minimum cut with the best-fit, and the simulations show that our solution achieves better results.
机译:在云数据中心,虚拟机(VM)和物理机之间的不同映射关系(PMS)导致不同的资源利用率,因此,如何将VM放置在PM上以改善资源利用率,并且降低能耗是云提供商的主要问题之一。现有的VM Placement方案是优化物理服务器资源利用率或网络资源利用率,但其中很少有人侧重于同时优化多个资源利用率。要解决此问题,本文提出了一个符合多个资源限制的VM放置方案,例如物理服务器大小(CPU,内存,存储,带宽等)和网络链路容量,以提高资源利用率并减少活动的数量物理服务器和网络元件,以最终降低能耗。由于VM放置问题被抽象为箱包装问题和二次分配问题的组合,因此也称为经典组合优化和NP-COLLICT问题,我们通过将最小剪切与最佳合适的最小剪切组合来设计一种新颖的贪婪算法模拟表明,我们的解决方案实现了更好的结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号