Efficient virtual machine placement algorithms for consolidation in cloud data centers

2Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Alsbatin, L., Öz, G., & Ulusoy, A. H. (2020). Efficient virtual machine placement algorithms for consolidation in cloud data centers. Computer Science and Information Systems, 17(1), 29–50. https://doi.org/10.2298/CSIS181122036A

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free