Distance Aware VM allocation process to minimize energy consumption in cloud computing

2019 ◽  
Vol 12 ◽  
Author(s):  
Gurpreet Singh ◽  
Manish Mahajan ◽  
Rajni Mohana
Keyword(s):  
Resource Allocation ◽  
Cloud Computing ◽  
Energy Consumption ◽  
Virtual Machine ◽  
Virtual Machines ◽  
Research Work ◽  
Service Level Agreement ◽  
Service Level ◽  
Physical Machine ◽  
Allocation Process

BACKGROUND: Cloud computing is considered as an on-demand service resource with the applications towards data center on pay per user basis. For allocating the resources appropriately for the satisfaction of user needs, an effective and reliable resource allocation method is required. Because of the enhanced user demand, the allocation of resources has now considered as a complex and challenging task when a physical machine is overloaded, Virtual Machines share its load by utilizing the physical machine resources. Previous studies lack in energy consumption and time management while keeping the Virtual Machine at the different server in turned on state. AIM AND OBJECTIVE: The main aim of this research work is to propose an effective resource allocation scheme for allocating the Virtual Machine from an ad hoc sub server with Virtual Machines. EXECUTION MODEL: The execution of the research has been carried out into two sections, initially, the location of Virtual Machines and Physical Machine with the server has been taken place and subsequently, the cross-validation of allocation is addressed. For the sorting of Virtual Machines, Modified Best Fit Decreasing algorithm is used and Multi-Machine Job Scheduling is used while the placement process of jobs to an appropriate host. Artificial Neural Network as a classifier, has allocated jobs to the hosts. Measures, viz. Service Level Agreement violation and energy consumption are considered and fruitful results have been obtained with a 37.7 of reduction in energy consumption and 15% improvement in Service Level Agreement violation.

scholarly journals Priority-Based Virtual Machine Selection Algorithm in Cloud Computing

2019 ◽  
Vol 8 (3) ◽  
pp. 1457-1462
Keyword(s):  
Cloud Computing ◽  
Quality Of Service ◽  
Virtual Machine ◽  
Virtual Machines ◽  
Service Level Agreement ◽  
Cloud Service ◽  
Service Level ◽  
Cloud Services ◽  
Cloud Service Provider

Cloud computing technology has gained the attention of researchers in recent years. Almost every application is using cloud computing in one way or another. Virtualization allows running many virtual machines on a single physical computer by sharing its resources. Users can store their data on datacenter and run their applications from anywhere using the internet and pay as per service level agreement documents accordingly. It leads to an increase in demand for cloud services and may decrease the quality of service. This paper presents a priority-based selection of virtual machines by cloud service provider. The virtual machines in the cloud datacenter are configured as Amazon EC2 and algorithm is simulated in cloud-sim simulator. The results justify that proposed priority-based virtual machine algorithm shortens the makespan, by 11.43 % and 5.81 %, average waiting time by 28.80 % and 24.50%, and cost of using the virtual machine by 21.24% and 11.54% as compared to FCFS and ACO respectively, hence improving quality of service.

scholarly journals Task Based Virtual Machine Placement in Cloud

2020 ◽  
Vol 9 (5) ◽  
pp. 1994-1998
Keyword(s):  
Cloud Computing ◽  
Energy Consumption ◽  
Virtual Machine ◽  
Virtual Machines ◽  
Research Work ◽  
Test System ◽  
Vm Placement ◽  
Cloud Architecture ◽  
Use Of Resources ◽  
Placement Algorithm

Cloud computing offers many advantages by optimizing various parameters to meet the complex requirements .Some of the problems of cloud computing are utilization of resources and less energy consumption. More research and resources heterogeneity complicates the consolidation problem inside cloud architecture. VM placement refers to an ideal mapping of a task to virtual machines (VM) and virtual machines to physical machines (PM). The task-based VM placement algorithm is introduced in this research work. Here tasks are divided in accordance with their requirements, and then search for appropriate VM, again searching for appropriate PM, where selected VM could be sent. The algorithm decreases the use of resources by devaluation of the number of dynamic PMs while further decreases the rate of dismissal of make span and assignment. CloudSim test System is used to evaluate our algorithm in this research work. The outcomes of this implementation show the effectiveness of some current algorithms such as Round robin and Shortest Job First (SJF) algorithms.

Virtual Machines Scheduling Algorithm Based on Multi-Objective Optimization in Cloud Computing

2014 ◽  
Vol 1046 ◽  
pp. 508-511
Author(s):  
Jian Rong Zhu ◽  
Yi Zhuang ◽  
Jing Li ◽  
Wei Zhu
Keyword(s):  
Cloud Computing ◽  
Energy Consumption ◽  
Virtual Machine ◽  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Machine Scheduling ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Virtual Machine Scheduling ◽  
Set Up

How to reduce energy consumption while improving utility of datacenter is one of the key technologies in the cloud computing environment. In this paper, we use energy consumption and utility of data center as objective functions to set up a virtual machine scheduling model based on multi-objective optimization VMSA-MOP, and design a virtual machine scheduling algorithm based on NSGA-2 to solve the model. Experimental results show that compared with other virtual machine scheduling algorithms, our algorithm can obtain relatively optimal scheduling results.

Resource Allocation Policies in Cloud Computing Environment

2017 ◽  
pp. 115-132 ◽  
Author(s):  
Suvendu Chandan Nayak ◽  
Sasmita Parida ◽  
Chitaranjan Tripathy ◽  
Prasant Kumar Pattnaik
Keyword(s):  
Resource Allocation ◽  
Cloud Computing ◽  
Resource Utilization ◽  
Service Level Agreement ◽  
Service Level ◽  
Computing Environment ◽  
Cloud Computing Environment ◽  
On Demand ◽  
Different Types ◽  
Cloud Datacenter

The basic concept of cloud computing is based on “Pay per Use”. The user can use the remote resources on demand for computing on payment basis. The on-demand resources of the user are provided according to a Service Level Agreement (SLA). In real time, the tasks are associated with a time constraint for which they are called deadline based tasks. The huge number of deadline based task coming to a cloud datacenter should be scheduled. The scheduling of this task with an efficient algorithm provides better resource utilization without violating SLA. In this chapter, we discussed the backfilling algorithm and its different types. Moreover, the backfilling algorithm was proposed for scheduling tasks in parallel. Whenever the application environment is changed the performance of the backfilling algorithm is changed. The chapter aims implementation of different types of backfilling algorithms. Finally, the reader can be able to get some idea about the different backfilling scheduling algorithms that are used for scheduling deadline based task in cloud computing environment at the end.

Optimal Management of Cloud Centers with Different Arrival Modes for Cloud Computing Environment

2012 ◽  
Vol 2 (3) ◽  
pp. 86-97
Author(s):  
Veena Goswami ◽  
Sudhansu Shekhar Patra ◽  
G. B. Mund
Keyword(s):  
Cloud Computing ◽  
Virtual Machines ◽  
Service Level Agreement ◽  
Service Level ◽  
Finite Buffer ◽  
Web Browser ◽  
Computing Paradigm ◽  
Computing Services ◽  
Multi Server

Cloud computing is a new computing paradigm in which information and computing services can be accessed from a Web browser by clients. Understanding of the characteristics of computer service performance has become critical for service applications in cloud computing. For the commercial success of this new computing paradigm, the ability to deliver guaranteed Quality of Services (QoS) is crucial. Based on the Service level agreement, the requests are processed in the cloud centers in different modes. This paper analyzes a finite-buffer multi-server queuing system where client requests have two arrival modes. It is assumed that each arrival mode is serviced by one or more Virtual machines, and both the modes have equal probabilities of receiving service. Various performance measures are obtained and optimal cost policy is presented with numerical results. The genetic algorithm is employed to search the optimal values of various parameters for the system.

Towards A Virtual Machine Migration Algorithm Based On Multi-Objective Optimization

2017 ◽  
Vol 8 (3) ◽  
pp. 79-89 ◽  
Author(s):  
Xiang Chen ◽  
Jun-rong Tang ◽  
Yong Zhang
Keyword(s):  
Energy Consumption ◽  
Virtual Machine ◽  
Resource Competition ◽  
Service Level Agreement ◽  
Service Level ◽  
Multi Objective Optimization ◽  
Virtual Machine Migration ◽  
Multi Objective ◽  
Time Migration ◽  
Management Method

In the cloud computing, the virtual machine (VM) dynamical management method needs to consider VM resource re-configuration caused by system computation resource status changing and load fluctuation. Based on migration objectives as QoS (Quality of Service), resource competition and energy consumption, the VM migration time, migration objective node selection and VM placement strategies are designed in this work. The Multi-Criteria Decision-Making (MCDM) method is also introduced for migration destination host selection. Experiment results show that the multi-objective optimization management method with TOPSIS can achieve lower service-level agreement (SLA) violation rate, less energy consumption and better balance among different objectives.

Service Level Agreement Conformance in Virtual Machine Migration with an Improved Energy and Performance Management Method

2020 ◽  
Vol 17 (9) ◽  
pp. 3904-3906
Author(s):  
Susmita J. A. Nair ◽  
T. R. Gopalakrishnan Nair
Keyword(s):  
Energy Consumption ◽  
Performance Management ◽  
Large Scale ◽  
Data Centers ◽  
Virtual Machines ◽  
Service Level Agreement ◽  
Service Level ◽  
Performance Degradation ◽  
Virtual Machine Migration ◽  
And Performance

Increasing demand of computing resources and the popularity of cloud computing have led the organizations to establish of large-scale data centers. To handle varying workloads, allocating resources to Virtual Machines, placing the VMs in the most suitable physical machine at data centers without violating the Service Level Agreement remains a big challenge for the cloud providers. The energy consumption and performance degradation are the prime focus for the data centers in providing services by strictly following the SLA. In this paper we are suggesting a model for minimizing the energy consumption and performance degradation without violating SLA. The experiments conducted have shown a reduction in SLA violation by nearly 10%.

SLA and Performance Efficient Heuristics for Virtual Machines Placement in Cloud Data Centers

2017 ◽  
Vol 9 (3) ◽  
pp. 17-33 ◽  
Author(s):  
Oshin Sharma ◽  
Hemraj Saini
Keyword(s):  
Energy Consumption ◽  
Data Centers ◽  
Virtual Machines ◽  
Service Level Agreement ◽  
Service Level ◽  
Consolidation Process ◽  
Cloud Data ◽  
Trade Offs ◽  
And Performance ◽  
High Level

Cloud computing has revolutionized the working models of IT industry and increasing the demand of cloud resources which further leads to increase in energy consumption of data centers. Virtual machines (VMs) are consolidated dynamically to reduce the number of host machines inside data centers by satisfying the customer's requirements and quality of services (QoS). Moreover, for using the services of cloud environment every cloud user has a service level agreement (SLA) that deals with energy and performance trade-offs. As, the excess of consolidation and migration may degrade the performance of system, therefore, this paper focuses the overall performance of the system instead of energy consumption during the consolidation process to maintain a trust level between cloud's users and providers. In addition, the paper proposed three different heuristics for virtual machine (VM) placement based on current and previous usage of resources. The proposed heuristics ensure a high level of service level agreements (SLA) and better performance of ESM metric in comparison to previous research.

An Energy-efficient Virtual Machine Placement Algorithm based Service Level Agreement in Cloud Computing Environments

2017 ◽  
Vol 2 (6) ◽  
pp. 1-6
Author(s):  
Arash Mazidi ◽  
Elham Damghanijazi ◽  
Sajad Tofighy
Keyword(s):  
Cloud Computing ◽  
Virtual Machines ◽  
Service Level Agreement ◽  
Service Level ◽  
Model Management ◽  
Time Data ◽  
Computing Services ◽  
Cloud Computing Services ◽  
Placement Algorithm ◽  
Leading Enterprises

The cloud computing has given services to the users throughout the world during recent years. The cloud computing services have been founded according to ‘As-Pay-You-Go’ model and some leading enterprises give these services. The giving these cloud-computing services has been developed every day and these requirements necessitate for more infrastructures and Internet providers (IPs). The nodes of data centers consume a lot of energy in cloud structure and disseminate noticeable amount of carbon dioxide into the environment. We define a framework and structure for cloud environment of efficient energy in the present paper. We examine the present problems and challenges based on this structure and then present and model management algorithms and source allocation in cloud computing environment in order to manage energy in addition to considering Service Level Agreement. The proposed algorithm has been implemented by cloudsim simulator where the obtained results from simulation of real-time data indicate that the proposed method is superior to previous techniques in terms of energy consumption and observance of Service Level Agreement. Similarly, number of live migration of virtual machines and quantity of transferred data has been improved.

Sign in / Sign up

Export Citation Format

Share Document