Based on Hybrid Particle Swarm Optimization Algorithm Respectively Research on Multiprocessor Task Scheduling

摘要

Multiprocessor system plays an important role in the computer, in order to improve the parallel computing performance of the system, its essence is to solve a multiprocessor system task scheduling algorithm of NP problem, and the TSP (traveling salesman problem) is a typical NP-complete problem. This article will be attributed to solve multiprocessor task scheduling multiprocessor task scheduling of TSP combination optimization problems. In this article, through the experiment to verify the hybrid particle swarm optimization algorithm and genetic algorithm in solving TSP multiprocessor task scheduling optimization problems, the experimental results show that the hybrid particle swarm optimization algorithm in solving the questions of different size of task scheduling is not only to solve the high quality, and solving the faster, the perform better than genetic algorithm.