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

虚拟机合并问题的一种切割求解算法

A Cut-and-solve Algorithm for Virtual Machine Consolidation Problem

Jiang-Yao Luo, Liang Chen, Wei-Kun Chen, Jian-Hua Yuan, Yu-Hong Dai

摘要:

虚拟机整合问题(VMCP)试图确定要激活哪些服务器,如何将虚拟机(VM)分配给激活的服务器,以及如何在服务器之间迁移VM,使得激活、分配和迁移成本的总和最小化,服从服务器的资源约束和其他实际约束。在本文中,我们首先提出了一个新的混合整数线性规划(MILP)制定的VMCP。我们表明,与现有的配方相比,所提出的配方是更紧凑的变量或约束的数量较少,这使得它适合于解决大规模的问题。然后,我们开发了一个切割和解决(C&S)算法,树搜索算法,有效地解决VMCP的最优性。建议的C&S算法是基于一种新的松弛的VMCP,提供了一个更强的下限比自然连续松弛的VMCP,使一个较小的搜索树。通过大量的计算实验,我们表明:(i)所提出的公式在求解效率方面明显优于现有公式;(ii)与标准MILP求解器相比,所提出的C&S算法效率更高.

英文摘要:

The virtual machine consolidation problem (VMCP) attempts to determine which servers to be activated, how to allocate virtual machines (VMs) to the activated servers, and how to migrate VMs among servers such that the summation of activated, allocation, and migration costs is minimized subject to the resource constraints of the servers and other practical constraints. In this paper, we first propose a new mixed integer linear programming (MILP) formulation for the VMCP. We show that compared with existing formulations, the proposed formulation is much more compact in terms of smaller numbers of variables or constraints, which makes it suitable for solving large-scale problems. We then develop a cut-and-solve (C&S) algorithm, a tree search algorithm to efficiently solve the VMCP to optimality. The proposed C&S algorithm is based on a novel relaxation of the VMCP that provides a stronger lower bound than the natural continuous relaxation of the VMCP, making a smaller search tree. By extensive computational experiments, we show that (i) the proposed formulation significantly outperforms existing formulations in terms of solution efficiency; and (ii) compared with standard MILP solvers, the proposed C&S algorithm is much more efficient.

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

↑