Scheduling the Tasks in Cloud Computing using Adaptive Adjustment in Whale Optimization Algorithm

One of the most popular infrastructures for employing virtual machines, also known as processing units, is cloud computing. Task scheduling is fundamental problems of cloud computing. A number of methods to handle the nondeterministic polynomial-time (NP)-complete optimisation issue of choosing the best scheduling criteria in cloud computing have been proposed by academics in the past. An effective optimisation approach is suggested in this research, based on the whale optimisation algorithm (WOA), to address the common problems of solution algorithms, which include poor global optimisation ability, ease of sliding into local optimisation, and sluggish convergence speed. We provide an adaptive adjustment method that may dynamically alter search behaviour during the whale optimisation algorithm’s iterative operation. The technique described to further update the position of search individuals also uses the evolutionary approach of differential variation. The algorithm’s exploration and development capacities are then balanced, and a restart approach is included to keep the system from entering local optimisation. The approach simultaneously resolves the work planning issue in the situation of rain cloud processing. When compared to other algorithms, this technique uses more resources and converges more quickly. Additionally, the evaluation function seeks for the optimal answers by taking the makespan, resource cost, and load balancing level into account.