Task Based V irtual M achine Placement in Cloud

Abstract

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.