首页> 外文会议>European Dependable Computing Conference >A Proactive Q-Learning Approach for Autoscaling Heterogeneous Cloud Servers
【24h】

A Proactive Q-Learning Approach for Autoscaling Heterogeneous Cloud Servers

机译:自动播放异构云服务器的主动Q学习方法

获取原文

摘要

Cloud providers offer different physical or virtual machine (VM) types that have different computational power and cost. Choosing the right configuration in a such heterogeneous environment able to sustain a workload while minimising costs is a challenging key aspect. Furthermore, turning-on/off a VM does not come for free, but introduce a reconfiguration overhead that might bring additional costs (e.g. time for moving to the new state and wasted resources for reconfiguration process). In this paper, we aim to find at run time a configuration s.t. (i) is able to sustain an input workload, (ii) does not over-provide resources, and that (iii) is as close as possible to the current one, to minimise the number of involved VMs in the reconfiguration, and thus, minimise the reconfiguration overhead. We propose here a Q-Learning approach to automatically learn the best policy to move from a configuration to another according to a predicted workload. We defined two reward functions which respectively look for (i) a configuration which perfectly fits the requested workload and (ii) a configuration which arrives close to the requested workload, to minimise the reconfiguration overhead. We compared the results with the two reward functions in term of average number of VMs involved in a reconfiguration and we show as with the first reward function we need to change in average 2.3 VM/reconfiguration while with the second reward function we can reduce such number up to 1 VM per reconfiguration with some over-provisioning.
机译:云提供商提供具有不同计算能力和成本的不同物理或虚拟机(VM)类型。在这种能够维持工作量的这种异构环境中选择正确的配置,同时最小化成本是一个具有挑战性的关键方面。此外,VM的打开/关闭不会免费出现,但引入了可能带来额外成本的重新配置开销(例如,移动到新状态的时间并浪费资源以进行重新配置过程)。在本文中,我们的目标是在运行时找到配置S.T. (i)能够维持输入工作负载,(ii)不会过度提供资源,并且(iii)尽可能靠近当前的资源,以最小化重新配置中涉及的VM的数量,因此最小化重新配置开销。我们在这里提出了一种Q学习方法,可以自动学习最佳策略,以根据预测的工作负载从配置移动到另一个策略。我们定义了两个奖励函数,分别查找(i)一个完全适合所请求的工作负载的配置和(ii)到达靠近所请求的工作负载的配置,以最大限度地减少重新配置开销。我们将结果与两项奖励功能进行比较,在重新配置中涉及的平均VMS数量,我们显示与第一个奖励函数一样,我们需要平均更改2.3 VM /重新配置,同时使用第二个奖励功能,我们可以减少这样的数字每个重新配置最多1 VM,具有一些过度配置。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号