首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >Simple and Effective Dynamic Provisioning for Power-Proportional Data Centers
【24h】

Simple and Effective Dynamic Provisioning for Power-Proportional Data Centers

机译:电力有效数据中心的简单有效的动态配置

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

摘要

Energy consumption represents a significant cost in data center operation. A large fraction of the energy, however, is used to power idle servers when the workload is low. Dynamic provisioning techniques aim at saving this portion of the energy, by turning off unnecessary servers. In this paper, we explore how much gain knowing future workload information can bring to dynamic provisioning. In particular, we develop online dynamic provisioning solutions with and without future workload information available. We first reveal an elegant structure of the offline dynamic provisioning problem, which allows us to characterize the optimal solution in a “divide-and-conquer” manner. We then exploit this insight to design two online algorithms with competitive ratios $(2-alpha)$ and $(e/(e-1+alpha ))$, respectively, where $(0le alpha le 1)$ is the normalized size of a look-ahead window in which future workload information is available. A fundamental observation is that future workload information beyond the full-size look-ahead window (corresponding to $(alpha =1)$) will not improve dynamic provisioning performance. Our algorithms are decentralized and easy to implement. We demonstrate their effectiveness in simulations using real-world traces.
机译:能源消耗代表着数据中心运营的重大成本。但是,当工作负载较低时,很大一部分能量用于为空闲服务器供电。动态预配置技术旨在通过关闭不必要的服务器来节省这部分能量。在本文中,我们探索了解未来的工作负载信息可以为动态预配置带来多少收益。特别是,我们开发了带有或不带有未来工作负载信息的在线动态预配置解决方案。我们首先揭示了脱机动态预配置问题的优雅结构,这使我们能够以“分而治之”的方式描述最佳解决方案。然后,我们利用这一洞察力设计两个竞争率分别为$(2-alpha)$和$(e /(e-1 + alpha))$的在线算法,其中$(0le alpha le 1)$是归一化大小前瞻窗口的窗口,其中将来的工作负载信息可用。一个基本的观察结果是,超出全尺寸超前窗口(对应于$(alpha = 1)$)的未来工作负载信息不会提高动态预配置性能。我们的算法是分散的,易于实现。我们使用真实世界的轨迹展示了它们在模拟中的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号