Optimization Task Scheduling Using Cooperation Search Algorithm for Heterogeneous Cloud Computing Systems.

Gespeichert in:
Bibliographische Detailangaben
Titel: Optimization Task Scheduling Using Cooperation Search Algorithm for Heterogeneous Cloud Computing Systems.
Autoren: Hamed, Ahmed Y., Elnahary, M. Kh., Alsubaei, Faisal S., El-Sayed, Hamdy H.
Quelle: Computers, Materials & Continua; 2023, Vol. 75 Issue 1, p2133-2148, 16p
Schlagwörter: SEARCH algorithms, COMPUTER systems, HETEROGENEOUS computing, SCHEDULING, CLOUD computing, GENETIC algorithms, PRODUCTION scheduling
Abstract: Cloud computing has taken over the high-performance distributed computing area, and it currently provides on-demand services and resource polling over the web. As a result of constantly changing user service demand, the task scheduling problem has emerged as a critical analytical topic in cloud computing. The primary goal of scheduling tasks is to distribute tasks to available processors to construct the shortest possible schedule without breaching precedence restrictions. Assignments and schedules of tasks substantially influence system operation in a heterogeneous multiprocessor system. The diverse processes inside the heuristic-based task scheduling method will result in varying makespan in the heterogeneous computing system. As a result, an intelligent scheduling algorithm should efficiently determine the priority of every subtask based on the resources necessary to lower the makespan. This research introduced a novel efficient scheduling task method in cloud computing systems based on the cooperation search algorithm to tackle an essential task and schedule a heterogeneous cloud computing problem. The basic idea of thismethod is to use the advantages of meta-heuristic algorithms to get the optimal solution. We assess our algorithm's performance by running it through three scenarios with varying numbers of tasks. The findings demonstrate that the suggested technique beats existingmethods NewGenetic Algorithm (NGA), Genetic Algorithm (GA), Whale Optimization Algorithm (WOA), Gravitational Search Algorithm (GSA), and Hybrid Heuristic and Genetic (HHG) by 7.9%, 2.1%, 8.8%, 7.7%, 3.4% respectively according to makespan. [ABSTRACT FROM AUTHOR]
Copyright of Computers, Materials & Continua is the property of Tech Science Press and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Datenbank: Complementary Index
Beschreibung
Abstract:Cloud computing has taken over the high-performance distributed computing area, and it currently provides on-demand services and resource polling over the web. As a result of constantly changing user service demand, the task scheduling problem has emerged as a critical analytical topic in cloud computing. The primary goal of scheduling tasks is to distribute tasks to available processors to construct the shortest possible schedule without breaching precedence restrictions. Assignments and schedules of tasks substantially influence system operation in a heterogeneous multiprocessor system. The diverse processes inside the heuristic-based task scheduling method will result in varying makespan in the heterogeneous computing system. As a result, an intelligent scheduling algorithm should efficiently determine the priority of every subtask based on the resources necessary to lower the makespan. This research introduced a novel efficient scheduling task method in cloud computing systems based on the cooperation search algorithm to tackle an essential task and schedule a heterogeneous cloud computing problem. The basic idea of thismethod is to use the advantages of meta-heuristic algorithms to get the optimal solution. We assess our algorithm's performance by running it through three scenarios with varying numbers of tasks. The findings demonstrate that the suggested technique beats existingmethods NewGenetic Algorithm (NGA), Genetic Algorithm (GA), Whale Optimization Algorithm (WOA), Gravitational Search Algorithm (GSA), and Hybrid Heuristic and Genetic (HHG) by 7.9%, 2.1%, 8.8%, 7.7%, 3.4% respectively according to makespan. [ABSTRACT FROM AUTHOR]
ISSN:15462218
DOI:10.32604/cmc.2023.032215