Handling Process Overruns and Underruns on Multiprocessors in a Fault-Tolerant Real-Time Embedded System

被引:0
作者
Xu, Jia [1 ]
机构
[1] York Univ, Dept Elect Engn & Comp Sci, Toronto, ON, Canada
来源
2018 14TH IEEE/ASME INTERNATIONAL CONFERENCE ON MECHATRONIC AND EMBEDDED SYSTEMS AND APPLICATIONS (MESA) | 2018年
关键词
SCHEDULING ALGORITHM; RELEASE TIMES; PRECEDENCE; DEADLINES;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The failure of safety-critical hard real-time embedded systems, can have catastrophic consequences. In such systems, a fault tolerant design is often necessary to enable the system to continue to provide a specified service, possibly at a reduced level of performance, rather than failing completely, in spite of system errors. One approach for achieving fault tolerance in real-time embedded systems, is to provide two versions of programs for each real-time task: a primary and an alternate. If an error in the execution of the primary of a task is detected, or if the successful completion of the primary cannot be guaranteed, then the alternate will be activated, while the primary will be aborted. This paper presents a method which provides a higher level of system dependency and reliability by effectively handling underruns and overruns in a fault tolerant real-time embedded system which uses a primary and an alternate for each real-time task to achieve fault tolerance. A main advantage of this method is that it significantly increases the chances that either the primary or the alternate of each process will be able to successfully complete its computation before its deadline despite overrunning, which significantly increases system robustness and reliability, while at the same time any additional processor capacity created at run-time due to primary or alternate underruns can be efficiently utilized, which increases system resource and processor utilization, while also satisfying additional complex constraints defined on the primaries and alternates such as precedence and exclusion relations.
引用
收藏
页数:8
相关论文
共 15 条
[1]   Basic concepts and taxonomy of dependable and secure computing [J].
Avizienis, A ;
Laprie, JC ;
Randell, B ;
Landwehr, C .
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2004, 1 (01) :11-33
[2]   Efficient reclaiming in reservation-based real-time systems with variable execution times [J].
Caccamo, M ;
Buttazzo, GC ;
Thomas, DC .
IEEE TRANSACTIONS ON COMPUTERS, 2005, 54 (02) :198-213
[3]   SOME RESULTS OF THE EARLIEST DEADLINE SCHEDULING ALGORITHM [J].
CHETTO, H ;
CHETTO, M .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1989, 15 (10) :1261-1269
[4]   Performance of algorithms for scheduling real-time systems with overrun and overload [J].
Gardner, MK ;
Liu, JWS .
PROCEEDINGS OF THE 11TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, 1999, :287-296
[5]  
Han C-C., 2003, IEEE T COMPUTERS, V52
[6]  
JIA X, 1990, IEEE T SOFTWARE ENG, V16, P360, DOI 10.1109/32.48943
[7]   AN OPTIMAL ONLINE SCHEDULING ALGORITHM FOR OVERLOADED UNIPROCESSOR REAL-TIME SYSTEMS [J].
KOREN, G ;
SHASHA, D .
SIAM JOURNAL ON COMPUTING, 1995, 24 (02) :318-339
[8]  
Laprie J.-C., 1985, Fifteenth Annual International Symposium on Fault-Tolerant Computing FTCS 15. Digest of Papers. (Cat. No. 85CH2143-6), P2
[9]   A FAULT-TOLERANT SCHEDULING PROBLEM [J].
LIESTMAN, AL ;
CAMPBELL, RH .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1986, 12 (11) :1089-1095
[10]   An optimal fixed-priority assignment algorithm for supporting fault-tolerant hard real-time systems [J].
Lima, GMD ;
Burns, A .
IEEE TRANSACTIONS ON COMPUTERS, 2003, 52 (10) :1332-1346