loading...
A Fault-tolerant Technique for Scheduling Periodic Tasks in Real-time Systems
Vienna, Austria May 11-May 12
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/WSTFEUS.2004.10002Second IEEE Workshop on Software Tech ...
 This Article 
 
PDF
HTML
IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Y. S. Hong, Dongguk University, Seoul, Korea
H. W. Goo, Dongguk University, Seoul, Korea
We present in this paper a heuristic for producing a fault-tolerant schedule of given periodic tasks in distributed real-time systems. Tasks are divided into two classes according to their task utilization. In order to recover from faults, a hybrid scheme based on space redundancy and time redundancy is used. We use a very simple and fast heuristic to provide fault tolerance and reduce time overhead in case of transient faults in distributed real-time systems. We show that our approach can improve processor utilization.
Index Terms:
fault tolerance, rate monotonic algorithm, real-time scheduling, time redundancy, processor utilization
Citation:
Y. S. Hong, H. W. Goo, "A Fault-tolerant Technique for Scheduling Periodic Tasks in Real-time Systems," wstfeus, pp.135, Second IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems (WSTFEUS'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.