A Hybrid Gravitational Emulation Local Search-Based Algorithm for Task Scheduling in Cloud Computing

39Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The flexibility of cloud computing to provide a dynamic and adaptable infrastructure in the context of information technology and service quality has made it one of the most challenging issues in the computer industry. Task scheduling is a major challenge in cloud computing. Scheduling tasks so that they may be processed by the most effective cloud network resources has been identified as a critical challenge for maximizing cloud computing's performance. Due to the complexity of the issue and the size of the search space, random search techniques are often used to find a solution. Several algorithms have been offered as possible solutions to this issue. In this study, we employ a combination of the genetic algorithm (GA) and the gravitational emulation local search (GELS) algorithm to overcome the task scheduling issue in cloud computing. GA and the particle swarm optimization (PSO) algorithms are compared to the suggested algorithm to demonstrate its efficacy. The suggested algorithm outperforms the GA and PSO, as shown by the experiments.

Cite

CITATION STYLE

APA

Praveen, S. P., Ghasempoor, H., Shahabi, N., & Izanloo, F. (2023). A Hybrid Gravitational Emulation Local Search-Based Algorithm for Task Scheduling in Cloud Computing. Mathematical Problems in Engineering, 2023. https://doi.org/10.1155/2023/6516482

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free