Energy Efficient Cloud Computing Vm Placement Based On Genetic Algorithm

Author(s):  
Pooja Daharwal ◽  
◽  
Varsha Sharma
Author(s):  
Hang Zhou ◽  
Samina Kausar ◽  
Ningning Dong

Nowadays Energy Consumption has been a heavy burden on the enterprise cloud computing infrastructure. This paper focuses on the hardware factors in energy consumption. Inspired by DVFS, it proposes a new energy-efficient (EE) model. This paper formulates the scheduling problem and genetic algorithm is applied to obtain higher efficiency value. Simulations are implemented to verify the advantage of genetic algorithm. In addition, the robustness of our strategy is validated by modifying the relevant parameters of the experiment.


Author(s):  
Deepika Saxena ◽  
Ashutosh Kumar Singh

Background: Load balancing of communication-intensive applications, allowing efficient resource utilization and minimization of power consumption is a challenging multi-objective virtual machine (VM) placement problem. The communication among inter-dependent VMs, raises network traffic, hampers cloud client's experience and degrades overall performance, by saturating the network. Introduction: Cloud computing has become an indispensable part of Information Technology (IT), which supports the backbone of digitization throughout the world. It provides shared pool of IT resources, which are: always on, accessible from anywhere, at anytime and delivered on demand, as a service. The scalability and pay-per-use benefits of cloud computing has driven the entire world towards on-demand IT services that facilitates increased usage of virtualized resources. The rapid growth in the demands of cloud resources has amplified the network traffic in and out of the datacenter. Cisco Global Cloud Index predicts that by the year 2021, the network traffic among the devices within the datacenter will grow at Compound Annual Growth Rate (CAGR) of 23.4% Methods: To address these issues, a communication cost aware and resource efficient load balancing (CARE-LB) framework is presented, that minimizes communication cost, power consumption and maximize resource utilization. To reduce the communication cost, VMs with high affinity and inter-dependency are intentionally placed closer to each other. The VM placement is carried out by applying the proposed integration of Particle Swarm Optimization and non-dominated sorting based Genetic Algorithm i.e. PSOGA algorithm encoding VM allocation as particles as well as chromosomes. Results: The performance of proposed framework is evaluated by the execution of numerous experiments in the simulated datacenter environment and it is compared with the state-of-the-art methods like, Genetic Algorithm, First-Fit, Random-Fit and Best-Fit heuristic algorithms. The experimental outcome reveals that the CARE-LB framework improves 11% resource utilization, minimize 4.4% power consumption, 20.3% communication cost with reduction of execution time up to 49.7% over Genetic Algorithm based Load Balancing framework. Conclusion: The proposed CARE-LB framework provides promising solution for faster execution of data-intensive applications with improved resource utilization and reduced power consumption. Discussion: In the observed simulation, we analyze all the three objectives, after execution of the proposed multi-objective VM allocations and results are shown in Table 4. To choose the number of users for analysis of communication cost, the experiments are conducted with different number of users. For instance, for 100 VMs we choose 10, 20,...,80 users, and their request for VMs (number of VMs and type of VMs) are generated randomly, such that the total number of requested VMs do not exceed number of available VMs.


2016 ◽  
Vol 2016 ◽  
pp. 1-9
Author(s):  
Li Deng ◽  
Yang Li ◽  
Li Yao ◽  
Yu Jin ◽  
Jinguang Gu

Cloud computing enables scalable computation based on virtualization technology. However, current resource reallocation solution seldom considers the stability of virtual machine (VM) placement pattern. Varied workloads of applications would lead to frequent resource reconfiguration requirements due to repeated appearance of hot nodes. In this paper, several algorithms for VM placement (multiobjective genetic algorithm (MOGA), power-aware multiobjective genetic algorithm (pMOGA), and enhanced power-aware multiobjective genetic algorithm (EpMOGA)) are presented to improve stability of VM placement pattern with less migration overhead. The energy consumption is also considered. A type-matching controller is designed to improve evolution process. Nondominated sorting genetic algorithm II (NSGAII) is used to select new generations during evolution process. Our simulation results demonstrate that these algorithms all provide resource reallocation solutions with long stabilization time of nodes. pMOGA and EpMOGA also better balance the relationship of stabilization and energy efficiency by adding number of active nodes as one of optimal objectives. Type-matching controller makes EpMOGA superior to pMOGA.


Author(s):  
Ramandeep Kaur ◽  
Navpreet Kaur

The cloud computing can be essentially expressed as aconveyance of computing condition where distinctive assets are conveyed as a support of the client or different occupants over the web. The task scheduling basically concentrates on improving the productive use of assets and henceforth decrease in task fruition time. Task scheduling is utilized to allot certain tasks to specific assets at a specific time occurrence. A wide range of systems has been exhibited to take care of the issues of scheduling of various tasks. Task scheduling enhances the productive use of asset and yields less reaction time with the goal that the execution of submitted tasks happens inside a conceivable least time. This paper talks about the investigation of need, length and due date based task scheduling calculations utilized as a part of cloud computing.


Author(s):  
Ge Weiqing ◽  
Cui Yanru

Background: In order to make up for the shortcomings of the traditional algorithm, Min-Min and Max-Min algorithm are combined on the basis of the traditional genetic algorithm. Methods: In this paper, a new cloud computing task scheduling algorithm is proposed, which introduces Min-Min and Max-Min algorithm to generate initialization population, and selects task completion time and load balancing as double fitness functions, which improves the quality of initialization population, algorithm search ability and convergence speed. Results: The simulation results show that the algorithm is superior to the traditional genetic algorithm and is an effective cloud computing task scheduling algorithm. Conclusion: Finally, this paper proposes the possibility of the fusion of the two quadratively improved algorithms and completes the preliminary fusion of the algorithm, but the simulation results of the new algorithm are not ideal and need to be further studied.


Sign in / Sign up

Export Citation Format

Share Document