Constraint Programming-Based Virtual Machines Placement Algorithm in Datacenter - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Constraint Programming-Based Virtual Machines Placement Algorithm in Datacenter

(1, 2) , (2)
1
2

Abstract

As underlying infrastructure of cloud computing platform, datacenter is seriously underutilized, however, its operating costs is high. In this paper, we implement virtual machines placement algorithm in CloudSim using constraint programming approach. We first formulate the problem of virtual machines placement in virtualized datacenters as a variant of multi-dimensions bin packing problem, and then exploit constraint solver to solve this problem with the objective of minimizing number of physical machines that host virtual machines. Finally, we compare different virtual placement algorithms for evaluating constraint programming-based virtual machine placement algorithm including the built-in virtual machine placement algorithm in CloudSim and FFD algorithm. The experimental results show that constraint programming-based virtual machines placement algorithm can efficiently reduce the number of physical machines to achieve the goal of reducing datacenter operating costs and improving resource utilization.
Fichier principal
Vignette du fichier
978-3-642-32891-6_37_Chapter.pdf (243.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01524982 , version 1 (19-05-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Yonghong Yu, Yang Gao. Constraint Programming-Based Virtual Machines Placement Algorithm in Datacenter. 7th International Conference on Intelligent Information Processing (IIP), Oct 2012, Guilin, China. pp.295-304, ⟨10.1007/978-3-642-32891-6_37⟩. ⟨hal-01524982⟩
54 View
366 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More