Hybrid Elephant Herding Optimization Approach for Cloud Computing Load Scheduling

Author(s):  
Ivana Strumberger ◽  
Eva Tuba ◽  
Nebojsa Bacanin ◽  
Milan Tuba
2018 ◽  
Vol 71 ◽  
pp. 861-871 ◽  
Author(s):  
Divya Chaudhary ◽  
Bijendra Kumar

2018 ◽  
Vol 17 (01) ◽  
pp. 1850009 ◽  
Author(s):  
Divya Chaudhary ◽  
Bijendra Kumar

The cloud computing is an augmentative and progressive paradigm that supports a huge amount of characteristics. It demands the optimal allocation of resources to the tasks present in the virtual machines (VMs) system using load scheduling algorithms. The basic objective of load scheduling is to avoid system overloading and thereby achieve higher throughput by maximising VM utilisation along with cost stabilisation. The first come first serve and min–min approaches allocate the load in a static manner and resources are left underutilised. The particle swarm optimisation obtains the motivation from the social behaviour of the flock of birds. It analyses various approaches for load scheduling. The paper proposes an improved balanced load scheduling approach based on particle swarm optimisation (BPSO) to minimise total transfer time and total cost stabilisation. The proposed BPSO approach is compared with the existing approaches used for load scheduling in cloudlets. The efficiency in terms of the transfer time and cost of the proposed algorithm is showcased with the help of simulation results. As evident from the results, the proposed algorithm reduces transfer time and cost than the prevalent algorithms thereby making a system with stable cost.


2019 ◽  
Vol 8 (3) ◽  
pp. 44 ◽  
Author(s):  
Ivana Strumberger ◽  
Milan Tuba ◽  
Nebojsa Bacanin ◽  
Eva Tuba

Cloud computing technology enables efficient utilization of available physical resources through the virtualization where different clients share the same underlying physical hardware infrastructure. By utilizing the cloud computing concept, distributed, scalable and elastic computing resources are provided to the end-users over high speed computer networks (the Internet). Cloudlet scheduling that has a significant impact on the overall cloud system performance represents one of the most important challenges in this domain. In this paper, we introduce implementations of the original and hybridized monarch butterfly optimization algorithm that belongs to the category of swarm intelligence metaheuristics, adapted for tackling the cloudlet scheduling problem. The hybridized monarch butterfly optimization approach, as well as adaptations of any monarch butterfly optimization version for the cloudlet scheduling problem, could not be found in the literature survey. Both algorithms were implemented within the environment of the CloudSim platform. The proposed hybridized version of the monarch butterfly optimization algorithm was first tested on standard benchmark functions and, after that, the simulations for the cloudlet scheduling problem were performed using artificial and real data sets. Based on the obtained simulation results and the comparative analysis with six other state-of-the-art metaheuristics and heuristics, under the same experimental conditions and tested on the same problem instances, a hybridized version of the monarch butterfly optimization algorithm proved its potential for tackling the cloudlet scheduling problem. It has been established that the proposed hybridized implementation is superior to the original one, and also that the task scheduling problem in cloud environments can be more efficiently solved by using such an algorithm with positive implications to the cloud management.


2020 ◽  
Vol 14 (3) ◽  
pp. 3117-3128
Author(s):  
Xuan Chen ◽  
Long Cheng ◽  
Cong Liu ◽  
Qingzhi Liu ◽  
Jinwei Liu ◽  
...  

Symmetry ◽  
2018 ◽  
Vol 10 (12) ◽  
pp. 756
Author(s):  
Ming-Hua Lin ◽  
Jung-Fa Tsai ◽  
Yi-Chung Hu ◽  
Tzu-Hsuan Su

Virtualization is one of the core technologies used in cloud computing to provide services on demand for end users over the Internet. Most current research allocates virtual machines to physical machines based on CPU utilization. However, for many applications that require communication between services running on different servers, communication costs influence the overall performance. Therefore, this study focuses on the optimal allocation of virtual machines across multiple geographically dispersed data centers, with the objective of minimizing communication costs. The original problem can be constructed as a quadratic assignment problem that is a classical NP-hard combinatorial optimization problem. This study adopts an efficient deterministic optimization approach to reformulate the original problem as a mixed-integer linear program that may be solved to obtain a globally optimal solution. Since the required bandwidth matrix and communication cost matrix are symmetric, the mathematical model of virtual machine placement can be simplified. Several numerical examples drawn from the literature are solved to demonstrate the computational efficiency of the proposed method for determining the optimal virtual machine allocation in cloud computing.


Sign in / Sign up

Export Citation Format

Share Document