TY - JOUR
T1 - Task-level re-execution framework for improving fault tolerance on symmetry multiprocessors
AU - Baek, Hyeongboo
AU - Lee, Jaewoo
N1 - Publisher Copyright:
© 2019 by the authors.
PY - 2019/5/1
Y1 - 2019/5/1
N2 - Hard real-time systems are employed in military, aeronautics, and astronautics fields where deployed systems are susceptible to software faults that can result in functional errors. Thus, there is a need to use fault-tolerant (FT) real-time scheduling. Among the various fault-tolerant real-time scheduling techniques, re-execution has been applied widely to existing real-time systems owing to its simplicity and applicability. However, re-execution requires multiple executions of every task, and some tasks miss their deadlines owing to the prolonged execution time; therefore, it has been found to be suitable for only soft real-time systems. In this paper, we propose an FT policy that can be incorporated into most (if not all) existing real-time scheduling algorithms on multiprocessor systems, which improves the reliability of the target system without a tradeoff against schedulability. As a case study, we apply the FT policy to existing fixed-priority scheduling and earliest deadline zero-laxity scheduling, and we demonstrate that it enhances reliability without schedulability loss.
AB - Hard real-time systems are employed in military, aeronautics, and astronautics fields where deployed systems are susceptible to software faults that can result in functional errors. Thus, there is a need to use fault-tolerant (FT) real-time scheduling. Among the various fault-tolerant real-time scheduling techniques, re-execution has been applied widely to existing real-time systems owing to its simplicity and applicability. However, re-execution requires multiple executions of every task, and some tasks miss their deadlines owing to the prolonged execution time; therefore, it has been found to be suitable for only soft real-time systems. In this paper, we propose an FT policy that can be incorporated into most (if not all) existing real-time scheduling algorithms on multiprocessor systems, which improves the reliability of the target system without a tradeoff against schedulability. As a case study, we apply the FT policy to existing fixed-priority scheduling and earliest deadline zero-laxity scheduling, and we demonstrate that it enhances reliability without schedulability loss.
KW - Earliest deadline first
KW - Earliest deadline zero-laxity
KW - Fault tolerance
KW - Real-time scheduling;multiprocessor systems
KW - Schedulability analysis
KW - Zero-laxity policy
UR - http://www.scopus.com/inward/record.url?scp=85066328701&partnerID=8YFLogxK
U2 - 10.3390/sym11050651
DO - 10.3390/sym11050651
M3 - Article
AN - SCOPUS:85066328701
SN - 2073-8994
VL - 11
JO - Symmetry
JF - Symmetry
IS - 5
M1 - 651
ER -