Abstract—This paper presents a modified best fit decreasing
algorithm (MBFD algorithm) for virtual machines dynamic
migration scheduling model. The model uses the bin packing
problem classical approximation algorithm idea, designs a new
algorithm to deal with virtual machines dynamic migrating
scheduling. It finds out load hot-spot hosts in the cloud platform
by executing the selection algorithm program. Then the
resource loads of virtual machines in hot-spot hosts are sorted
in descending order. As for non-hot-spot hosts, their resource
loads are sorted in ascending order. By traversing the
non-hot-spot hosts queue, it can find the most appropriate host
to act as the migration target host.
Index Terms—Cloud computing, virtual machine dynamic
migrating, resource scheduling, load balance.
Xin Lu is with the School of Information and Software Engineering,
University of Electronic Science and Technology of China, Chengdu, China
(e-mail: luxinmail@uestc.edu.cn).
Zhuanzhuan Zhang is with the School of Computer Science and
Engineering, University of Electronic Science and Technology of China,
Chengdu, China (e-mail: zhuanzhuanzhang@126.com).
[PDF]
Cite:Xin Lu and Zhuanzhuan Zhang, "A Virtual Machine Dynamic Migration Scheduling Model Based on MBFD Algorithm," International Journal of Computer Theory and Engineering vol. 7, no. 4, pp. 278-282, 2015.
