Abstract

The paper proposes a method for parallelizing migrations to reduce the time required for virtual machine (VM) relocation. During VM relocation, VMs need to wait for their migrations in a chain due to the limited resource of the physical machines (PMs), lengthening the VM relocation time. The essence of the proposed scheme is to break off the VMs' chained migration wait and enables VM migrations to be performed in parallel. The VMs' chained migration wait can be broken off by allowing some VMs, called breakup VMs, to migrate without waiting. A breakup VM is the first VM in a chain of migrations with which the total migration time is reduced when the chain is split at that VM and performed in parallel. Breakup VMs are selected recursively from all the split migration chains until the total migration time can no longer be reduced. After all breakup VMs are selected, VMs' chained migrations are parallelized by temporarily migrating the breakup VMs to spare PMs regardless of their initial migration order. The performance of the proposed scheme is evaluated through simulation. The VM relocation time is affected by the number of VMs and PM utilization in a cluster. Therefore, we simulate relocations of 100---800 VMs in clusters with different average CPU and memory utilizations of PMs. The simulation results show that the proposed scheme reduces VM relocation time by 21.9---62.0 % while using 1.6---5.8 % spare PMs to parallelize the chained migrations.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call