Black widow optimization algorithm for efficient task assignment in cloud computing.

Uloženo v:
Podrobná bibliografie
Název: Black widow optimization algorithm for efficient task assignment in cloud computing.
Autoři: Wu, Huimin
Zdroj: Journal of Engineering & Applied Science; 6/20/2024, Vol. 71 Issue 1, p1-20, 20p
Abstrakt: Cloud computing was developed by blending virtualization and grid computing technologies. Its purpose is to provide Internet-based, on-demand, and consumption-based access to pools of computing resources in a measurable, adaptable, and scalable manner. Task scheduling is essential to cloud computing to ensure the performance of cloud services. However, inefficient scheduling can lead to resource issues such as under-allocation and over-allocation, which wastes resources and degrades service performance. Therefore, metaheuristic algorithms are incorporated into task scheduling systems to efficiently and timely distribute complex and diverse incoming tasks to limited resources. This study aims to analyze task priorities and precisely assign them to virtual machines. This is achieved by utilizing the Black Widow Optimization (BWO) algorithm. The primary objectives are to reduce time and energy consumption, improve task success rates, and optimize turnaround efficiency. Ultimately, these improvements aim to enhance the overall trustworthiness of the system. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Engineering & Applied Science 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.)
Databáze: Complementary Index
Buďte první, kdo okomentuje tento záznam!
Nejprve se musíte přihlásit.