An IFWA-BSA Based Approach for Task Scheduling in Cloud Computing

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Establishing an efficient cloud computing task scheduling model is the object of many scholars' research. In view of the low scheduling efficiency in cloud computing task scheduling, we propose a cloud computing task scheduling algorithm based on the fusion of the Fireworks Algorithm and Bird Swarm Algorithm (IFWA-BSA). Firstly, we describe the cloud computing task scheduling model based on time and cost constraint functions, secondly, we use chaotic backward learning and Coasean distribution for optimization in FWA initialization; we set thresholds for the radius of core fireworks and non-core fireworks for optimization; we filter the IFWA individuals after each iteration by BSA algorithm, and finally, we use the IFWA-BSA algorithm is used in cloud computing task scheduling model to solve the optimal solution. In the simulation experiments, IFWA-BSA has obvious advantages over ACO, PSO and FWA in the comparison of execution time and consumption cost indexes, which reduces the scheduling time and cost of cloud computing.

Cite

CITATION STYLE

APA

Li, X. (2023). An IFWA-BSA Based Approach for Task Scheduling in Cloud Computing. Journal of ICT Standardization, 11(1), 45–66. https://doi.org/10.13052/jicts2245-800X.1113

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