A proactive population dynamics load balancing algorithm in cloud computing for QoS optimisation
by Shahbaz Afzal; G. Kavitha
International Journal of Grid and Utility Computing (IJGUC), Vol. 12, No. 5/6, 2021

Abstract: Load unbalancing is a grim concern among cloud service providers that has adverse consequences on Quality of Service (QoS) and profit turnout. Load balancing tries to overcome load imbalances by ensuring proper task deployment among cloud resources, yielding productive resource utilisation, throughput, and other QoS metrics. A proactive load balancing approach featuring population dynamics model called as PPDLB model is proposed to limit the tasks within the maximum carrying capacity of VM. The PPDLB algorithm was compared with the existing Improved Weighted Round Robin (IWRR), Harris Hawk Optimisation (HHO) and Spider Monkey Optimisation (SMO) algorithms. The PPDLB algorithm was found to be efficient than existing algorithms in terms of makespan, resource utilisation, degree of balance and number of task migrations. The dominance of the proposed algorithm over existing load balancing techniques lies in the fact that it eliminates the need to solve migration associated metrics. Moreover, it has greater convergence rate when search space becomes large which makes it feasible for large scale scheduling problems.

Online publication date: Fri, 07-Jan-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com