JOURNAL ARTICLE

Virtual Machine Placement in Cloud Computing

Arunkumar KumarCiddhesh SathasivamPrakash Periyasamy

Year: 2016 Journal:   Indian Journal of Science and Technology Vol: 9 (29)   Publisher: Indian Society for Education and Environment

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 extentKeywords: CloudSim , First Last Algorithm , Hardware Virtualization , Migration, Resource Scalability

Keywords:
Computer science Host (biology) Virtual machine Cloud computing Bin packing problem Overhead (engineering) Virtualization Distributed computing Live migration Energy consumption Operating system Bin Algorithm

Metrics

14
Cited By
5.98
FWCI (Field Weighted Citation Impact)
0
Refs
0.96
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Cloud Computing and Resource Management
Physical Sciences →  Computer Science →  Information Systems
IoT and Edge/Fog Computing
Physical Sciences →  Computer Science →  Computer Networks and Communications
Distributed and Parallel Computing Systems
Physical Sciences →  Computer Science →  Computer Networks and Communications

Related Documents

BOOK-CHAPTER

Dynamic Virtual Machine Placement in Cloud Computing

Arnab K. PaulBibhudatta Sahoo

Advances in systems analysis, software engineering, and high performance computing book series Year: 2016 Pages: 136-167
JOURNAL ARTICLE

Virtual machine placement strategies in cloud computing

P. Divya BharathiP PrakashM Kiran

Journal:   2017 Innovations in Power and Advanced Computing Technologies (i-PACT) Year: 2017 Pages: 1-7
BOOK-CHAPTER

Virtual Machine Placement for Edge and Cloud Computing

Behdad PartoviAlireza BagheriMaryam Haddad KazarjiClaus PahlHamid R. Barzegar

Communications in computer and information science Year: 2021 Pages: 53-64
© 2026 ScienceGate Book Chapters — All rights reserved.