首页> 外文会议>International workshop on energy efficient data centers >Power-Aware Resource Allocation for CPU- and Memory-Intense Internet Services
【24h】

Power-Aware Resource Allocation for CPU- and Memory-Intense Internet Services

机译:CPU和内存密集型Internet服务的功耗感知资源分配

获取原文

摘要

Internet service providers face the daunting task of maintaining guaranteed latency requirements while reducing power requirements. In this work, we focus on a class of services with very high cpu and memory demands, best represented by internet search. These services provide strict latency guarantees defined in Service-Level Agreements, yet the clusters need to be flexible to different optimizations, i.e. to minimize power consumption or to maximize resource usage. Unfortunately, standard cluster algorithms, such as resource allocation, are oblivious of the SLA allocations, while power management is typically only driven by cpu demand. We propose a power-aware resource allocation algorithm for the cpu and the memory which is driven by SLA and allows for various dynamic cluster configurations, from energy-optimal to resource-usage-optimal. Using trace-based simulation of two service models, we show that up to 24% energy can be preserved compared to the state-of-art scheme, or maximum memory utility can be achieved with 20% savings.
机译:互联网服务提供商面临着艰巨的任务,即保持有保证的等待时间要求,同时降低功耗要求。在这项工作中,我们专注于对CPU和内存的需求非常高的一类服务,最好以互联网搜索为代表。这些服务提供了服务级别协议中定义的严格的延迟保证,但是群集需要灵活地适应不同的优化,即最小化功耗或最大化资源使用。不幸的是,诸如资源分配之类的标准群集算法没有考虑SLA分配,而电源管理通常仅由CPU需求驱动。我们提出了一种针对CPU和内存的功耗感知资源分配算法,该算法由SLA驱动,并支持各种动态集群配置,从能源优化到资源使用优化。通过使用两种服务模型的基于跟踪的模拟,我们显示出与最新方案相比,可以节省多达24%的能量,或者可以节省20%的方式实现最大的内存利用率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号