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

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.

Author(s):  
Nadim Rana ◽  
Muhammad Shafie Abd Latiff ◽  
Shafi'i Muhammad Abdulhamid

Virtual machine scheduling in the cloud is considered one of the major issue to solve optimal resource allocation problem on the heterogeneous datacenters. With respect to that, the key concern is to map the virtual machines (VMs) with physical machines (PMs) in a way that maximum resource utilization can be achieved with minimum cost. Due to the fact that scheduling is an NP-hard problem, a metaheuristic approach is proven to achieve a better optimal solution to solve this problem. In a rapid changing heterogeneous environment, where millions of resources can be allocated and deallocate in a fraction of the time, modern metaheuristic algorithms perform well due to its immense power to solve the multidimensional problem with fast convergence speed. This paper presents a conceptual framework for solving multi-objective VM scheduling problem using novel metaheuristic Whale optimization algorithm (WOA). Further, we present the problem formulation for the framework to achieve multi-objective functions.


2018 ◽  
Vol 7 (1) ◽  
pp. 16-19
Author(s):  
Anupama Gupta ◽  
Kulveer Kaur ◽  
Rajvir Kaur

Cloud computing is the architecture in which cloudlets are executed by the virtual machines. The most applicable virtual machines are selected on the basis of execution time and failure rate. Due to virtual machine overloading, the execution time and energy consumption is increased at steady rate. In this paper, BFO technique is applied in which weight of each virtual machine is calculated and the virtual machine which has the maximum weight is selected on which cloudlet will be migrated. The performance of proposed algorithm is tested by implementing it in CloudSim and analyzing it in terms of execution time, energy consumption.


Author(s):  
Mohammed Yousuf Uddin ◽  
Hikmat Awad Abdeljaber ◽  
Tariq Ahamed Ahanger

Cloud computing is developing as a platform for next generation systems where users can pay as they use facilities of cloud computing like any other utilities. Cloud environment involves a set of virtual machines, which share the same computation facility and storage. Due to rapid rise in demand for cloud computing services several algorithms are being developed and experimented by the researchers in order to enhance the task scheduling process of the machines thereby offering optimal solution to the users by which the users can process the maximum number of tasks through minimal utilization of the resources. Task scheduling denotes a set of policies to regulate the task processed by a system. Virtual machine scheduling is essential for effective operations in distributed environment. The aim of this paper is to achieve efficient task scheduling of virtual machines, this study proposes a hybrid algorithm through integrating two prominent heuristic algorithms namely the BAT Algorithm and the Ant Colony Optimization (ACO) algorithm in order to optimize the virtual machine scheduling process. The performance evaluation of the three algorithms (BAT, ACO and Hybrid) reveal that the hybrid algorithm performs better when compared with that of the other two algorithms.


Sign in / Sign up

Export Citation Format

Share Document