首页> 外文期刊>Mobile networks & applications >Service-Oriented Virtual Machine Placement Optimization for Green Data Center
【24h】

Service-Oriented Virtual Machine Placement Optimization for Green Data Center

机译:绿色数据中心的面向服务的虚拟机布局优化

获取原文
获取原文并翻译 | 示例

摘要

The first service-oriented virtual machine (VM) placement for green data center is designed in this work. Integer Linear Programming (ILP) is the problem design basis. The Tree algorithm is proposed to place VM role instances at the lowest communication cost, economizing the construction cost with fewer physical servers. Another Forest algorithm is also proposed for balancing the computation load between the physical machines. Both of the proposed algorithms are formulated on the graph theoretic technique and evaluated and analyzed using the Best Fit algorithm in the simulations. Although the total power consumption and average utility of both proposed algorithms are slightly impaired, the unnecessary outbound communication cost is significantly eliminated and decreased, especially in the immense number of services. The results show that the proposed Tree and Forest algorithms provide lower communication cost than the Best Fit algorithm, and achieve green communications for large scale environment such as cloud or green data center.
机译:这项工作设计了绿色数据中心的第一个面向服务的虚拟机(VM)放置。整数线性规划(ILP)是问题设计的基础。提出了Tree算法,以最低的通信成本放置VM角色实例,从而以较少的物理服务器节省了构建成本。还提出了另一种森林算法来平衡物理机之间的计算负荷。两种提出的算法都基于图论技术制定,并在仿真中使用最佳拟合算法进行了评估和分析。尽管这两种算法的总功耗和平均效用都略有下降,但不必要的出站通信成本却得以显着消除和降低,尤其是在大量服务中。结果表明,与最佳拟合算法相比,本文提出的树和森林算法具有更低的通信成本,并且可以在诸如云或绿色数据中心等大规模环境中实现绿色通信。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号