arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2006.05401cs.LO
收藏

基于优化模理论、数学规划和对称破缺的云应用可扩展优化部署

Scalable Optimal Deployment in the Cloud of Component-based Applications using Optimization Modulo Theory, Mathematical Programming and Symmetry Breaking

Madalina Erascu, Flavia Micota, Daniela Zaharie

摘要:

基于组件的应用程序的云资源供应问题在于将来自各种云提供商的虚拟机(VM)供应分配给一组应用程序,使得由组件之间的交互和组件硬件/软件要求引起的约束得到满足,并且性能目标得到优化(例如,成本最小化)。它可以用公式表示为约束优化问题,因此,原则上优化可以自动进行。在VM提供的集合很大(几百个)的情况下,计算需求是巨大的,使得自动优化实际上不可能使用当前的通用优化模理论(OMT)和数学规划(MP)工具。我们克服了困难,方法学分析的特殊性问题的目的是确定搜索空间减少方法。这些方法利用:(1)一般云部署问题的对称性,(2)与特定于每个特定应用程序的结构约束相关联的图形表示,以及(3)它们的组合。使用六种对称性破缺策略和两种类型的优化求解器对四类现实问题进行了广泛的实验分析。因此,当OMT用于解决所产生的优化问题时,变量缩减策略与列对称破坏器的组合导致可扩展的部署解决方案。

英文摘要:

The problem of Cloud resource provisioning for component-based applications consists in the allocation of virtual machines (VMs) offers from various Cloud Providers to a set of applications such that the constraints induced by the interactions between components and by the components hardware/software requirements are satisfied and the performance objectives are optimized (e.g. costs are minimized). It can be formulated as a constraint optimization problem, hence, in principle the optimization can be carried out automatically. In the case the set of VM offers is large (several hundreds), the computational requirement is huge, making the automatic optimization practically impossible with the current general optimization modulo theory (OMT) and mathematical programming (MP) tools. We overcame the difficulty by methodologically analyzing the particularities of the problem with the aim of identifying search space reduction methods. These are methods exploiting:(1) the symmetries of the general Cloud deployment problem, (2) the graph representation associated to the structural constraints specific to each particular application, and (3) their combination. An extensive experimental analysis has been conducted on four classes of real-world problems, using six symmetry breaking strategies and two types of optimization solvers. As a result, the combination of a variable reduction strategy with a column-wise symmetry breaker leads to a scalable deployment solution, when OMT is used to solve the resulting optimization problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑