An Initial Resource Scheduling Algorithm for OpenStack

Feng-Jun Shang, Lu-Zhong Li, Xuan-Ling Chen

Abstract


In view of resource scheduling problems in OpenStack, we put forward the initial resource scheduling algorithm based on matching hungry degree, which named as MHD-VMP.The algorithm computes the matching degree between the demand resource of the virtual machine and the available resources of the physical machine and the hungry degree of all the virtual machines in the physical machines, then we can get the matching hungry degree of matching pairs, which can select the most appropriate physical machine to place virtual machine.Finally, the simulation results demonstrate the proposed algorithm significantly outperforms the initial virtual machine placement algorithm of OpenStack.


DOI
10.12783/dtetr/apetc2017/11272

Full Text:

PDF

Refbacks

  • There are currently no refbacks.