Task Scheduling of Computational Grid Based on Particle Swarm Algorithm

The traditional scheduling theory can only get the approximate optimal solution of the problem, and most is to consider algorithms on a single task or independent multitask scheduling. It presents a particle swarm algorithm to solve the task scheduling problem of computational grid. It builds a task scheduling model of computational grid, changes the particle swarm algorithm in continuous space searching to an integer space searching, selects the appropriate inertia weight value, and enhances the searching capabilities of the algorithm. Through comparison with genetic algorithm, hybrid algorithm, and ant algorithm, the results show that the grid task scheduling algorithm has some advantages.