Efficient virtual machine placement algorithms for consolidation in cloud data centers | Zendy

Loiy Alsbatin | Zendy; Gürcü Öz | Zendy; Ali Hakan Ulusoy | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Efficient virtual machine placement algorithms for consolidation in cloud data centers

Author(s) -

Loiy Alsbatin,

Gürcü Öz,

Ali Hakan Ulusoy

Publication year - 2019

Publication title -

computer science and information systems

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.244

H-Index - 24

eISSN - 2406-1018

pISSN - 1820-0214

DOI - 10.2298/csis181122036a

Subject(s) - computer science , cloud computing , algorithm , virtual machine , workload , energy consumption , efficient energy use , service level agreement , quality of service , distributed computing , operating system , computer network , ecology , electrical engineering , biology , engineering

Dynamic Virtual Machine (VM) consolidation is a successful approach to improve the energy efficiency and the resource utilization in cloud environments. Consequently, optimizing the online energy-performance tradeoff directly influences quality of service. In this study, algorithms named as CPU Priority based Best-Fit Decreasing (CPBFD) and Dynamic CPU Priority based Best-Fit Decreasing (DCPBFD) are proposed for VM placement. A number of VM placement algorithms are implemented and compared with the proposed algorithms. The algorithms are evaluated through simulations with real-world workload traces and it is shown that the proposed algorithms outperform the known algorithms. The simulation results clearly show that CPBFD and DCPBFD provide the least service level agreement violations, least VM migrations, and efficient energy consumption.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research