EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-ND 4.0

Multi schemes for dynamic task scheduling in cloud computing infrastructure

C.A. Obidike, E.A. Edje, E.A. Fasanmi

Scientia Africana · 08.06.2025 · 24 (2) · 79-88

DOI: 10.4314/sa.v24i2.9 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Scientia Africana, online erschienen am 08.06.2025. Verfasst von C.A. Obidike und 2 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Cloud computing has emerged as a crucial technology in numerous sectors because of its affordability and scalability. Task scheduling for cloud-based systems is made extremely difficult by the dynamic nature of cloud computing, which includes elasticity, on-demand provisioning, a variety of resource types, and a range of pricing models. Thus, an effective scheduling strategy is required to maximize end-user happiness and cloud system performance. According to this study, a number of task scheduling strategies ranging from heuristic algorithms (Max-min, Min-min, etc), Meta-heuristic algorithm (Genetic Algorithm, Flower Pollination Algorithm, Seagul Optimization Algorithm, etc) to hybrid algorithms have been put forth that have enhanced cloud data centers' performance in terms of different scheduling parameters. The primary cause of the task scheduling problem's Nondeterministic Polynomial-time (NP) hard is that the number of possible solutions or combinations increases exponentially with the problem's size, such as the number of tasks and computing resources. As a result, scheduling user tasks in an entirely ideal manner is never easy. A hybrid Flower Pollination Algorithm-Seagull Optimization Algorithm (FPA-SOA) for task scheduling in cloud computing was suggested in this study. To minimize makespan and increase reliability, the suggested task scheduling technique load-balanced all incoming jobs to the available virtual machines. In terms of Makespan, reliability, and throughput, the performance of the suggested task scheduling algorithm was assessed and contrasted with the FPA technique. In comparison to the other approaches, the suggested method has demonstrated 50% reduction in Makespan and attained Reliability of 1 meaning there was no failure of any task.

Zitieren

APA

Obidike, C., Edje, E., & Fasanmi, E. (2025). Multi schemes for dynamic task scheduling in cloud computing infrastructure. Scientia Africana, 24(2), 79-88. https://doi.org/10.4314/sa.v24i2.9

Vancouver

Obidike C, Edje E, Fasanmi E. Multi schemes for dynamic task scheduling in cloud computing infrastructure. Scientia Africana. 2025;24(2):79-88. doi:10.4314/sa.v24i2.9

BibTeX
@article{Obidike2025,
  author = {Obidike, C.A. and Edje, E.A. and Fasanmi, E.A.},
  title = {Multi schemes for dynamic task scheduling in cloud computing infrastructure},
  journal = {Scientia Africana},
  year = {2025},
  volume = {24},
  number = {2},
  pages = {79--88},
  doi = {10.4314/sa.v24i2.9}
}
Kostenlos starten →