loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)
Fault-Tolerant Rate-Monotonic Scheduling Algorithm in Uniprocessor Embedded Systems
Riverside, California
December 18-December 20
ISBN: 0-7695-2724-8
Hakem Beitollahi, Katholieke Universiteit Leuven, Electrical Engineering, Kasteelpark Arenberg 10, Leuven, Belgium
Geert Deconinck, Katholieke Universiteit Leuven, Electrical Engineering, Kasteelpark Arenberg 10, Leuven, Belgium
The general approach to fault tolerance in uniprocessor systems is to use time redundancy in the schedule so that any task instance can be re-executed in presence of faults during the execution. In this paper a scheme is presented to add enough and efficient time redundancy to the Rate- Monotonic (RM) scheduling policy for periodic real-time tasks. This scheme can be used to tolerate transient faults during the execution of tasks. For performance evaluation of this idea a tool is developed.
Citation:
Hakem Beitollahi, Geert Deconinck, "Fault-Tolerant Rate-Monotonic Scheduling Algorithm in Uniprocessor Embedded Systems," prdc, pp.395-396, 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.