Research on Static Fault-Tolerance Scheduling Algorithm

Author

Zhao Qi ; Qu Haitao

Author_Institution

Coll. of Inf. & Electr. Eng., Hebei Univ. of Eng., Handan, China

Volume

3

fYear

2010

fDate

13-14 March 2010

Firstpage

179

Lastpage

181

Abstract

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.

Keywords

fault tolerant computing; scheduling; RMS; rate monotonic scheduling algorithm; static fault tolerance scheduling algorithm; static scheduling algorithms; Algorithm design and analysis; Automation; Educational institutions; Electric variables measurement; Fault tolerance; Fault tolerant systems; Mechatronics; Real time systems; Reliability; Scheduling algorithm; RMS; fault-tolerance scheduling algorithm; multiprocessors; primary/backup copy; real-time system;

fLanguage

English

Publisher

ieee

Conference_Titel

Measuring Technology and Mechatronics Automation (ICMTMA), 2010 International Conference on

Conference_Location

Changsha City

Print_ISBN

978-1-4244-5001-5

Electronic_ISBN

978-1-4244-5739-7

Type

conf

DOI

10.1109/ICMTMA.2010.722

Filename

5459878