The dynamic task scheduling in the multiprocessor system

The distributed multiprocessor system is increasingly applied in the equipment management of many kinds of vehicles (such as aircraft, ship et.). How to ensure the mission reliability of multiprocessor system is a key technology in these applications. In the paper, a task scheduling algorithm is illustrated, which is based on distributed processing. Through the tasks migrating among nodes in the system, the mission reliability of the multiprocessor system is raised. The algorithm resides in each node. The tradeoff between the optimum scheme and computation cost is made. The algorithm is so simple that the advantages of a distributed multiprocessor system is brought into play. The flexibility is proved through scheduling experiments. The performance ratio of the algorithm satisfies the requirement of vehicles