Vol.71, No.1, 2022, pp.1641-1660, doi:10.32604/cmc.2022.021793
OPEN ACCESS
ARTICLE
Hybrid Cuckoo Search Algorithm for Scheduling in Cloud Computing
  • Manoj Kumar*, Suman
CSE Department, DCR University of Science and Technology, Murthal, 131039, Sonepat, India
* Corresponding Author: Manoj Kumar. Email:
(This article belongs to this Special Issue: Recent Advances in Metaheuristic Techniques and Their Real-World Applications)
Received 15 July 2021; Accepted 27 August 2021; Issue published 03 November 2021
Abstract
Cloud computing has gained widespread popularity over the last decade. Scheduling problem in cloud computing is prejudiced due to enormous demands of cloud users. Meta-heuristic techniques in cloud computing have exhibited high performance in comparison to traditional scheduling algorithms. This paper presents a novel hybrid Nesterov Accelerated Gradient-based Cuckoo Search Algorithm (NAGCSA) to address the scheduling issue in cloud computing. Nesterov Accelerated Gradient can address trapping at local minima in CSA by updating the position using future approximation. The local search in the proposed algorithm is performed by using Nesterov Accelerated Gradient, while the global search is performed by using levy flights. The amalgamation of NAG and CSA helps in cost reduction and time-saving for users. The simulation has been carried out on the CloudSim tool on three different real datasets; NASA, HPC2N, and SDSC. The results of the proposed hybrid algorithm have been compared with state-of-art scheduling algorithms (GA, PSO, and CSA), and statistical significance is carried on mean, standard deviation, and best for each algorithm. It has been established that the proposed algorithm minimizes the execution cost and makespan, hence enhancing the quality of service for users.
Keywords
Cloud computing; scheduling; quality of service; cuckoo search; cost; makespan
Cite This Article
Kumar, M., , S. (2022). Hybrid Cuckoo Search Algorithm for Scheduling in Cloud Computing. CMC-Computers, Materials & Continua, 71(1), 1641–1660.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.