Loading...

Fault-tolerant earliest-deadline-first scheduling algorithm

Beitollahi, H ; Sharif University of Technology | 2007

277 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/IPDPS.2007.370608
  3. Publisher: 2007
  4. Abstract:
  5. The general approach to fault tolerance in uniprocessor systems is to maintain enough 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 Earliest-Deadline-First (EDF) scheduling policy for periodic real-time tasks. This scheme can be used to tolerate transient faults during the execution of tasks. We describe a recovery scheme which can be used to re-execute tasks in the event of transient faults and discuss conditions that must be met by any such recovery scheme. For performance evaluation of this idea a tool is developed. © 2007 IEEE
  6. Keywords:
  7. Computer system recovery ; Embedded systems ; Fault tolerance ; Program processors ; Real time systems ; Redundancy ; Scheduling algorithms ; Earliest deadline first scheduling algorithm ; Real time scheduling ; Time redundancy ; Fault tolerant computer systems
  8. Source: 21st International Parallel and Distributed Processing Symposium, IPDPS 2007, Long Beach, CA, 26 March 2007 through 30 March 2007 ; 2007 ; 1424409101 (ISBN); 9781424409105 (ISBN)
  9. URL: https://ieeexplore.ieee.org/abstract/document/4228336