Total views : 418

Virtual Machine Placement in Cloud Computing

Affiliations

  • Department of Computer Science Engineering, Amrita Vishwa Vidyapeetham, Amrita Nagar, Coimbatore - 641112, Tamil Nadu, India

Abstract


Objectives: Hardware virtualization is an evolving technology, because it has the potential to facilitate the consolidation of multiple workloads on a single physical host directly through cloud. We introduce the First-Last algorithm to minimize energy consumption and migration. Methods: The problem is treated as an instance of bin packing algorithm which focuses on saving energy. However the overloading of active hosts and the resultant migration are the drawbacks of this approach. This algorithm was tested on a set of heterogeneous virtual machines which have demands in both single and multi-dimension and came either statically or dynamically to the server. Findings: The virtual machine placement problem can be treated as a bin packing problem, wherein the physical machines/hosts are the bins and the virtual machines are the objects. It can then be solved through various approaches such as first fit, best fit, next fit et cetera. Using the first fit algorithm, the virtual machine is placed into the first active host which can accommodate it. If none of the active hosts satisfy the VM’s demand, then a new host is made active. In the best fit method, all the active hosts are checked first and then the host which would suffer minimum resource wastage upon VM placement is chosen. Next fit algorithm places the VM in the last /most recently activated host. While first fit is best suited for optimal performance, best fit keeps the least number of hosts active, thereby saving energy but at the cost of performance since migration overhead increases. Next fit approach would fail unless the virtual machines have been arranged in the increasing order of their demands. The firstlast algorithm that we introduce balances on energy consumption as well as performance by reducing migration. It also reduces the time complexity to a certain extent. Applications: The algorithm has a comparatively lower time complexity than the existing virtual machine placement algorithms. It also reduces the energy consumption as well as migration to a certain extent.

Keywords

CloudSim , First Last Algorithm , Hardware Virtualization , Migration, Resource Scalability.

Full Text:

 |  (PDF views: 814)

References


  • Shyamala K, Sunitha Rani T. An analysis on effiecient resource allocation mechanisms in cloud computing. Indian Journal of Science and Technology. 2015 May; 9(9).
  • Veerapan G, Suresh Gnana Dhas C. Secure Resource Allocation and Control of Virtualized Datacenter using SLO. Indian Journal of Science and Technology. 2015 Jun; 8(12). Doi: 12.17485/ijst/2015/v8i12/61939.
  • Lavanya Suja T, Savithri V. Backtracking algorithm for virtual cluster migration in cloud computing. Indian Journal of Science and Technology. 2015 Jul; 8(15). Doi: 10.17485/ijst/2015/v8il5/73232.
  • Thiruvenkadam T, Kamalakkannan P. Energy efficient multi dimensional host load aware algorithm for virtual machine placement and optimization in cloud environment. Indian Journal of Science and Technology. 2015 Aug; 8(17). Doi:10.17485/ijst/2015/v8il7/59140.
  • Types of Cloud Computing :Private, Public and Hybrid Clouds, appcore.com, Citrix Service provider, Web, Date Accessed-12/3/2015.
  • What is Cloud, ibm.com, IBMCLOUD, Web, Web, Date Accessed-08/4/2015.
  • InfraStructure as a Service (Iaas), searchcloudcomputing.techtarget.com, TechTarget, Web, Web, Date Accessed-02/3/2015.
  • Li K, Zheng H, and Wu J. Migration-based Virtual Machine Placement in Cloud Systems. 2nd International Conference on Cloud Networking (CloudNet), San Francisco, CA. 2013. p. 83 –90.
  • Beloglazov A. Energy-Efficient Management of Virtual Machines in Data Centers for Cloud Computing. Computing and Information Systems. 2013; pp. 44–74.

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.