A Particle Swarm Optimization Method for AI Stream Scheduling in Edge Environments

Abstract

With the development of IoT and 5G technologies, edge computing has become a key driver for providing compute, network and storage services. The dramatic increase in data size and the complexity of AI computation models have put higher demands on the performance of edge computing. Rational and optimal scheduling of AI data-intensive computation tasks can greatly improve the overall performance of edge computing. To this end, a particle swarm algorithm based on objective ranking is proposed to optimize task execution time and scheduling cost by designing a task scheduling model to achieve task scheduling in an edge computing environment. It is necessary to fully understand the concept of symmetry of resource utilization and task execution cost indicators. The method utilizes nonlinear inertia weights and shrinkage factor update mechanisms to improve the optimization-seeking ability and convergence speed of the particle-to-task scheduling solution space. The task execution time and scheduling cost are greatly reduced. Simulation experiments are conducted using the Cloudsim toolkit to experimentally compare the proposed algorithm TS-MOPSO with three other particle swarm improvement algorithms, and the experimental results show that the task execution time, maximum completion time and total task scheduling cost are reduced by 31.6%, 23.1% and 16.6%, respectively. The method is suitable for handling large and complex AI data-intensive task scheduling optimization efforts.