An Efficient Virtual Machine Placement Approach for Energy Minimizing in Cloud Environment

Authors

  • Dr . Khaldun Ibraheem Ibraheem Arif Computer Sciences Department, College of Education for pure Sciences, University of Thi-Qar
  • Rawafid Abdul Kadeem khayun Computer Sciences Department, College of Education for pure Sciences University of Thi-Qar

DOI:

https://doi.org/10.32792/jeps.v11i1.92

Keywords:

Cloud Computing, VM Placement, Energy Consumption, Bin Packing

Abstract

Cloud computing can be defined as an evolving Computing technology using the Internet and essential remote infrastructure to retain on-demand and pay-as-you-go assets. The number of data centers across the world has increased through wide adaptation to cloud principles, leading to large amounts of data center power consumption that affects the climate and economic aspects. So many virtual machines (VMs) could be installed on one Physical Machine(PM) via virtualization. The Cloud workload is held by these VMs and executed. Effective PM allocation of VMs will lead to better use of resources and energy savings. In this paper, our goal is to provide an improved Policy on energy-efficient VM placement to minimize energy consumption in the cloud environment, placing the VMs in the addressed bin backing mechanism and retaining the Service Level Agreement (SLA) between the provider and the cloud customer. Significant reduction in power consumption could even be made if convective are implemented at software level. Energy -aware scheduling processes produces excellent performance by implementing bin-packing energy efficiency mechanisms. An improved algorithm has been enhanced for the two First Fit Decreasing FFB and Best Fit Decreasing BFD algorithms, which are considered the best among bin packing algorithms. This algorithm adopts server power as the basis for arranging servers in the database, unlike the BFD, FFD algorithms that arrange servers according to CPU. The proposed algorithm has been practically tried using Matlab 2020 programing language for samples of servers and virtual machines, whose specifications were chosen randomly, and the results showed great efficiency of the proposed algorithm in reducing energy consumption

References

P. Mell and T. Grance, “The NIST Definition of Cloud Computing,” National Institute of Standard and

Technology, Information Technology Laboratory 800-145, 2011.

R. Buyya, S. Pandey, and C. Vecchiola, “Cloudbus toolkit for market oriented Cloud computing”,

International Conference on Cloud Computing, pp. 24–44, 2019.

H. Hu, X. Zhang, X. Yan, L. Wang, and Y. Xu, Solving a New 3D Bin Packing Problem with Deep

Reinforcement Learning Method, arXiv:1708.05930, 2017.

A. Andrae, Total Consumer Power Consumption Forecast, 2017.

Kaur, Taran deep, and Inderveer Chana. "Energy aware scheduling of dead line constrained tasks in

cloud computing." Cluster Computing 19.2, 679-698, 2016.

Journal of Education for Pure Science- University of Thi-Qar

Vol.11, No1 (June, 2021)

Website: jceps.utq.edu.iq Email: jceps@eps.utq.edu.iq

F. Hermenier, X. Lorca, J.-M. Menaud, G. Muller, and J. Lawall, “Entropy: a consolidation manager

for clusters,” in Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual

execution environments, VEE ’09, (New York, NY, USA), pp. 41–50, ACM, 2009.

Smith, James; Nair, Ravi. “The Architecture of Virtual Machines”. Computer. IEEE Computer

Society,2005.

Xiong FU and Chen ZHOU,” Virtual machine selection and placement for dynamic consolidation in

Cloud computing environment” ,2015.

R. Ranjana, S. Radha, J. Raja,” Performance study of resource aware energy efficient VM Placement

Algorithm” 2016.

A. Beloglazov and R. Buyya, “Optimal online deterministic algorithms and adaptive heuristics for

energy and performance efficient dynamic consolidation of virtual machines in Cloud data centres,”

Concurrency and Computation: Practice and Experience, vol. 24, no. 13, pp. 1397–1420, 2012.

BeloglazovA,BuyyaR.Openstackneat:Aframeworkfordynamicandenergyefficientconsolidationofvirtua

lmachinesinopenstack clouds. Concurr Comput Pract Experience ,2014.

Chowdhury MR, Mahmud MR, Rahman RM: Implementation and performance analysis of various VM

placement strategies in CloudSim. J Cloud Comput 4(1):1–21, 2015.

Mann ZÁ, Szabó M: Which is the best algorithm for virtual machine placement optimization? Concurr

Comput Pract Exp 29(10):4083, 2017.

Farahnakian F, Pahikkala T, Liljeberg P, Plosila J, Tenhunen H: Utilization Prediction Aware VM

Consolidation Approach for Green Cloud Computing. Proc - 2015 IEEE 8th Int Conf Cloud Comput

Cloud :381–388, 2015.

MannZÁ, SzabóM.” Which is the best algorithm for virtual machine placement optimization?”

ConcurrComput PractExp29(10):4083,2017.

Leena, V. A., Ajeena Beegom AS, and M. S. Rajasree. "Genetic algorithm based bi objective task

scheduling in hybrid cloud platform." International Journal of Computer Theory and Engineering 8.1,

-13, 2016.

Singh, Sukhpal. Efficient cloud workload management framework. Master thesis in Software

Engineering, Thapar university patala, 2013.

RawasS, ZekriA, Zaart AE “Power and cost-aware virtual machine placement Ingo-distributed

datacenters”. In: Proceedings of the 8th

InternationalConferenceonCloudComputingandServicesScienceVolume1: Closer.SciTePress. pp112–

,2018.

Beloglazov, A., Buyya, R.: Adaptive threshold-based approach for energy-efficient consolidation of

virtual machines in cloud data centers. In Proceedings of the 8th International Workshop on Middleware

for Grids, Clouds and e-Science, 2010

Downloads

Published

2021-06-10

Issue

Vol. 11 No. 1 (2021)

Section

Articles

License

Copyright Policy

Authors retain copyright of their articles published in the Journal of Education for Pure Science (JEPS).

By submitting their work, authors grant the journal a non-exclusive license to publish, distribute, and archive the article in all formats and media.

License

All articles published in JEPS are licensed under the Creative Commons Attribution 4.0 International License (CC BY 4.0).

This license permits unrestricted use, distribution, and reproduction in any medium, provided that the original author(s) and the source are properly credited.

Author Rights

Authors have the right to:

  • Share their articles on personal websites, institutional repositories, and academic platforms

  • Reuse their work in future research and publications

  • Distribute the published version without restriction

Journal Rights

The journal retains the right to:

  • Publish and archive the articles

  • Include them in indexing and archiving systems such as LOCKSS and CLOCKSS

  • Promote and disseminate the published work

Responsibility

The contents of all articles are the sole responsibility of the authors. The journal, editors, and editorial board are not responsible for any errors, opinions, or statements expressed in the published articles.

Open Access Statement

JEPS provides immediate open access to its content, supporting the principle that making research freely available to the public enhances global knowledge exchange.

This work is licensed under a Creative Commons Attribution 4.0 International License.
https://creativecommons.org/licenses/by/4.0/