A Bio-Inspired and Heuristic-Based Hybrid Algorithm for Effective Performance With Load Balancing in Cloud Environment

A Bio-Inspired and Heuristic-Based Hybrid Algorithm for Effective Performance With Load Balancing in Cloud Environment

Soumen Swarnakar, Souvik Bhattacharya, Chandan Banerjee
Copyright: © 2021 |Pages: 21
DOI: 10.4018/IJCAC.2021100104
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

In a cloud computing environment, effective scheduling policies and load balancing have always been the aim. An efficient task scheduler must be proficient in a dynamically distributed environment and to the policy of efficient scheduling of jobs based upon the workload. In this research, a novel hybrid heuristic algorithm is developed for balancing the load among cloud nodes. This is achieved by hybridizing the existing ant colony optimization (ACO), artificial bee colony algorithm (ABC), and AHP (analytical hierarchy process) algorithm. The AHP algorithm and the artificial bee colony (ABC) algorithm is used for figuring out the best servers suitable for a particular job, and the ant colony algorithm is used to find the most efficient path to that particular server. The proposed algorithm is better in resource utilization. It also performs better load balancing, which keeps on improving with time. The result analysis shows better average response time and better average makespan time compared to other two existing algorithms.
Article Preview
Top

X. Wei (2020) in their journal proposed a task scheduling optimization strategy using improved ant colony in cloud computing environment (TSOAC). In their proposed algorithm the author has addressed the issue of scheduling algorithms falling into a local optimal solution and combined their solution with efficient resource utilization to design a task scheduling optimal function to develop a task scheduling satisfaction function. A reward and punishment coefficients have been introduced to speed up the task allocation, but without focusing on the type of job and which VM it will be allocated to. The author has just mapped a correspondence with the first VM with the first job, second VM with second job etc. Drawing inspiration from this algorithm, the proposed algorithm in this paper not only addresses the problem of efficient path finding but also concentrates on doing efficient load balancing by paying attention to the particular types of jobs and allocation them VMs’ according to their need.

Jun-qing Li, Yun-qi Han et al. (2020) in their journal has proposed a multi objective artificial bee colony algorithm for flexible task scheduling in a cloud computing environment (MOABC). They have clubbed Artificial bee colony (ABC) with hybrid flowshop scheduling (HFS) to find out the most efficient server from a pool of servers.

Apart from multiple assumptions like processing of one job in one device only, not considering setup time on the same and also not considering setup time between two consecutive jobs in the same machine causes another major problem. In the first stage tasks are initially assigned to those which has minimum completion time. This might result the algorithm in falling into a local optimum and also a concern arises regarding proper resource utilization.

Complete Article List

Search this Journal:
Reset
Volume 14: 1 Issue (2024)
Volume 13: 1 Issue (2023)
Volume 12: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 11: 4 Issues (2021)
Volume 10: 4 Issues (2020)
Volume 9: 4 Issues (2019)
Volume 8: 4 Issues (2018)
Volume 7: 4 Issues (2017)
Volume 6: 4 Issues (2016)
Volume 5: 4 Issues (2015)
Volume 4: 4 Issues (2014)
Volume 3: 4 Issues (2013)
Volume 2: 4 Issues (2012)
Volume 1: 4 Issues (2011)
View Complete Journal Contents Listing