In EDS ansehen

Task scheduling in cloud computing systems using multi-objective honey badger algorithm with two hybrid elite frameworks and circular segmentation screening: Task scheduling in cloud computing systems...: S.-W. Zheng et al.

Gespeichert in:
Bibliographische Detailangaben
Titel: Task scheduling in cloud computing systems using multi-objective honey badger algorithm with two hybrid elite frameworks and circular segmentation screening: Task scheduling in cloud computing systems...: S.-W. Zheng et al.
Autoren: Zhang, Si-Wen, Wang, Jie-Sheng, Zhang, Shi-Hui, Xing, Yu-Xuan, Sui, Xiao-Fei, Zhang, Yun-Hao
Quelle: Artificial Intelligence Review; Feb2025, Vol. 58 Issue 2, p1-69, 69p
Schlagwörter: MULTI-objective optimization, ARTIFICIAL intelligence, CLOUD computing, COMPUTER systems, MATHEMATICAL optimization
Abstract: In cloud computing environment, task scheduling is the most critical problem to be solved. Two different multi-objective honey badger algorithms (MOHBA-I and MOHBA-II) based on hybrid elitist framework and circular segmentation screening are proposed for the multi-objective problem of task scheduling optimization in cloud computing systems. MOHBA-I and MOHBA-II combine the grid indexing mechanism and decomposition technique, respectively, to select better populations based on elite non-dominated sorting. A circular segmentation screening mechanism was proposed to retain the superior individuals when the regional density is too high to further maintain the diversity of the populations, and attach an external archive to preserve the uniformly diversified Pareto decomposition set. The performance of the proposed algorithms is verified by using test functions. MOHBA-I and MOHBA-II achieve the first and third rankings, respectively, compared to other classical multi-objective algorithms. Solve the cloud computing task scheduling problem using time, load and price cost as metrics, test for different task sizes, and compare MOHBA-I with algorithms such as NSGA-III, MOPSO and MOEA/D in the same experimental environment. When facing a large-scale task, MOHBA-I ranks first in HyperVolume value with 2.4449E−02 for two objectives and 9.2950E−03 for three objectives. The experimental results show that MOHBA-I finds the highest number of solutions with better convergence and coverage, obtaining a satisfactory Pareto front, which can provide more and better choices for decision makers. [ABSTRACT FROM AUTHOR]
Copyright of Artificial Intelligence Review is the property of Springer Nature 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:In cloud computing environment, task scheduling is the most critical problem to be solved. Two different multi-objective honey badger algorithms (MOHBA-I and MOHBA-II) based on hybrid elitist framework and circular segmentation screening are proposed for the multi-objective problem of task scheduling optimization in cloud computing systems. MOHBA-I and MOHBA-II combine the grid indexing mechanism and decomposition technique, respectively, to select better populations based on elite non-dominated sorting. A circular segmentation screening mechanism was proposed to retain the superior individuals when the regional density is too high to further maintain the diversity of the populations, and attach an external archive to preserve the uniformly diversified Pareto decomposition set. The performance of the proposed algorithms is verified by using test functions. MOHBA-I and MOHBA-II achieve the first and third rankings, respectively, compared to other classical multi-objective algorithms. Solve the cloud computing task scheduling problem using time, load and price cost as metrics, test for different task sizes, and compare MOHBA-I with algorithms such as NSGA-III, MOPSO and MOEA/D in the same experimental environment. When facing a large-scale task, MOHBA-I ranks first in HyperVolume value with 2.4449E−02 for two objectives and 9.2950E−03 for three objectives. The experimental results show that MOHBA-I finds the highest number of solutions with better convergence and coverage, obtaining a satisfactory Pareto front, which can provide more and better choices for decision makers. [ABSTRACT FROM AUTHOR]
ISSN:02692821
DOI:10.1007/s10462-024-11032-6