Efficient Cost Scheduling algorithm with Load Balancing in a Cloud Computing Environment

Author(s):  
Amanpreet Chawla, Navtej Singh
2021 ◽  
Vol 11 (1) ◽  
pp. 146-160
Author(s):  
Kaushik Mishra ◽  
Santosh Kumar Majhi

Abstract Task scheduling and load balancing are a concern for service providers in the cloud computing environment. The problem of scheduling tasks and balancing loads in a cloud is categorized under an NP-hard problem. Thus, it needs an efficient load scheduling algorithm that not only allocates the tasks onto appropriate VMs but also maintains the trade-off amidst VMs. It should keep an equilibrium among VMs in a way that reduces the makespan while maximizing the utilization of resources and throughput. In response to it, the authors propose a load balancing algorithm inspired by the mimicking behavior of a flock of birds, which is called the Bird Swarm Optimization Load Balancing (BSO-LB) algorithm that considers tasks as birds and VMs as destination food patches. In the considered cloud simulation environment, tasks are assumed to be independent and non-preemptive. To evaluate the efficacy of the proposed algorithm under real workloads, the authors consider a dataset (GoCJ) logged by Goggle in 2018 for the execution of cloudlets. The proposed algorithm aims to enhance the overall system performance by reducing response time and keeping the whole system balanced. The authors have integrated the binary variant of the BSO algorithm with the load balancing method. The proposed technique is analyzed and compared with other existing load balancing algorithms such as MAX-MIN, RASA, Improved PSO, and other scheduling algorithms as FCFS, SJF, and RR. The experimental results show that the proposed method outperforms when being compared with the different algorithms mentioned above. It is noteworthy that the proposed approach illustrates an improvement in resource utilization and reduces the makespan of tasks.


Cloud computing environment is a conglomeration of computing resources that are maintained to provide a plethora of services to users as utility on a pay-per-use basis. When users request for services, a cloud provider has to allocate relevant computing resources not only to complete a task but also to satisfy the user requirements such as deadlines. This necessitates the design of suitable scheduling algorithm for effective utilization of available resources at the provider’s end. While doing so one of the concerns of the provider is to balance the load uniformly across resources. In this paper, the Max-Min algorithm has been extended by incorporating the concept of free time in order to effectively utilize the cloud resources through load balancing and at the same time meet the deadlines of individual tasks.


Sign in / Sign up

Export Citation Format

Share Document