结合偏好处理的虚拟机放置问题研究

Research on virtual machine placement with preference processing

虚拟机的调度(放置)问题(Virtual Machine Placement,VMP)是云计算中的一个重要研究课题。它指的是使用特定的调度算法,将虚拟机放置到合适的主机上的过程,是一个典型的NP问题。目前的研究大量的使用了启发式的多目标优化算法,这类方法考虑了调度的目标与限制。针对满足目标和限制的条件下依旧会有多种解决方案的情况,引入了用户偏好表达的调度策略。具体的做法,首先,使用CP-nets定性地描述用户对虚拟机调度的偏好;其次,处理了多个用户偏好以及他们之间的冲突问题,最后,将元启发式算法得出的Pareto解进行偏好处理,返回满足用户偏好的最佳调度方案。实例分析和实验的结果表明,考虑用户偏好的虚拟机调度方案极大的提升了用户的满意程度。

The Virtual Machine Placement(VMP)problem is an important research topic in cloud computing.It refers to the process of placing a virtual machine on a suitable host using a specific scheduling algorithm,and is a typical NP problem.Current research makes extensive use of mata-heuristic multi-objective optimization algorithms,and such methods consider the goals and constraints of scheduling.A scheduling strategy with user preference expressions is introduced for the case where there will still be multiple solutions under the condition of satisfying the objectives and constraints.In particular,first,user preferences for VM scheduling are qualitatively described using CP-nets;second,multiple user preferences and conflicts among them are handled,and finally,the Pareto solution derived from the meta-heuristic algorithm is preference-processed to return the best scheduling solution that satisfies the user preferences.The results of the case analysis and experiments show that the virtual machine scheduling scheme that considers user preferences greatly improves user satisfaction.