Efficient Virtual Machine Placement in Data Center
Cloud computing provides many benefits by optimizing different parameters to reach the challenging requirements. Some of challenges in cloud computing are resource utilization and less energy consumption. More heterogeneity of work and resources makes the consolidation problem complicated within cloud architecture. An ideal mapping of a task to virtual machines (VM) and virtual machines to physical machines(PM) is referred as VM placement. In this research work task based VM placement algorithm is introduced. Here tasks are divided agreeing to their requirements, and after that looking for suitable VM , once more looking for suitable PM where chosen VM could be sent. The algorithm diminishes the resource utilization by devaluing count of dynamic PMs, whereas moreover decrease the make span and assignment dismissal rate. In this research we evaluated our algorithm in CloudSim test System. The results of this implementation demonstrates the effectiveness of introduced algorithm by some existing algorithms like Round robin and Shortest Job First(SJF).
Keywords: Makespan, Consolidation, Energy consumption ion, Clousim, cloud computing