Research on Static Fault-Tolerance Scheduling Algorithm

The static scheduling algorithms of real time are developed based on the RMS, which mainly deal with periodic tasks. But for the chance to contain a mixture of non-cyclical and occasional task, the traditional rate monotonic scheduling algorithm is no longer applicable. This paper analyzes and improves RMS algorithm, and combines the improved algorithms with P/B algorithm. The system is not only able to handle cycles and unpatriotic tasks with fault tolerance in processor utilization and the system´s reliability is also improved.