scholarly journals Mantaray modified multi-objective Harris hawk optimization algorithm expedites optimal load balancing in cloud computing

Author(s):  
Mohammad Haris ◽  
Swaleha Zubair
Author(s):  
Shashikant Raghunathrao Deshmukh ◽  
S. K. Yadav ◽  
D. N. Kyatanvar

In cloud computing, a lot of challenges like the server failures, loss of confidentiality, improper workloads, etc. are still bounding the efficiency of cloud systems in real-world scenarios. For this reason, many research works are being performed to overcome the shortcoming of existing systems. Among them, load balancing seems to be the most critical issue that worsen the performance of the cloud sector, and hence there necessitates the optimal load balancing with optimal task scheduling. With the intention of accomplishing optimal load balancing by effectual task deployment, this paper plans to develop an advanced load balancing model with the assistance acquired from the metaheuristic algorithms. Usually, handling of tasks in cloud system is an NP-hard problem and moreover, nonpreemptive independent tasks are crucial in cloud computing. This paper goes with the introduction of a new optimal load balancing model by considering three major objectives: minimum makespan, priority, and load balancing, respectively. Moreover, a new single-objective function is also defined that incorporates all the three objectives mentioned above. Furthermore, the deployment of tasks must be optimal and for this a new hybrid optimization algorithm referred as Firefly Movement insisted WOA (FM-WOA) is introduced. This FM-WOA is the conceptual amalgamation of standard Whale Optimization Algorithm (WOA) and Firefly (FF) algorithm. Finally, the performances of the proposed FM-WOA model is compared over the conventional models with the intention of proving its efficiency in terms of makespan, task completion (priority), and degree of imbalance as well.


2019 ◽  
Vol 8 (4) ◽  
pp. 9388-9394 ◽  

Cloud Computing is Internet based computing where one can store and access their personal resources from any computer through Internet. Cloud Computing is a simple pay-per-utilize consumer-provider service model. Cloud is nothing but large pool of easily accessible and usable virtual resources. Task (Job) scheduling is always a noteworthy issue in any computing paradigm. Due to the availability of finite resources and time variant nature of incoming tasks it is very challenging to schedule a new task accurately and assign requested resources to cloud user. Traditional task scheduling techniques are improper for cloud computing as cloud computing is based on virtualization technology with disseminated nature. Cloud computing brings in new challenges for task scheduling due to heterogeneity in hardware capabilities, on-demand service model, pay-per-utilize model and guarantee to meet Quality of Service (QoS). This has motivated us to generate multi-objective methods for task scheduling. In this research paper we have presented multi-objective prediction based task scheduling method in cloud computing to improve load balancing in order to satisfy cloud consumers dynamically changing needs and also to benefit cloud providers for effective resource management. Basically our method gives low probability value for not capable and overloaded nodes. To achieve the same we have used sigmoid function and Euclidean distance. Our major goal is to predict optimal node for task scheduling which satisfies objectives like resource utilization and load balancing with accuracy.


Sign in / Sign up

Export Citation Format

Share Document