An N-Modular Redundancy Framework Incorporating Response-Time Analysis on Multiprocessor Platforms

A timing constraint and a high level of reliability are the fundamental requirements for designing hard real-time systems. To support both requirements, the N modular redundancy (NMR) technique as a fault-tolerant real-time scheduling has been proposed, which executes identical copies for each task simultaneously on multiprocessor platforms, and a single correct one is voted on, if any. However, this technique can compromise the schedulability of the target system during improving reliability because it produces N identical copies of each job that execute in parallel on multiprocessor platforms, and some tasks may miss their deadlines due to the enlarged computing power required for completing their executions. In this paper, we propose task-level N modular redundancy (TL-NMR), which improves the system reliability of the target system of which tasks are scheduled by any fixed-priority (FP) scheduling without schedulability loss. Based on experimental results, we demonstrate that TL-NMR maintains the schedulability, while significantly improving average system safety compared to the existing NMR.

[1]  Giuseppe Lipari,et al.  Improved schedulability analysis of EDF on multiprocessor platforms , 2005, 17th Euromicro Conference on Real-Time Systems (ECRTS'05).

[2]  Giuseppe Lipari,et al.  Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms , 2009, IEEE Transactions on Parallel and Distributed Systems.

[3]  Björn Andersson,et al.  Scheduling Arbitrary-Deadline Sporadic Task Systems on Multiprocessors , 2008, 2008 Real-Time Systems Symposium.

[4]  Lui Sha,et al.  Priority Inheritance Protocols: An Approach to Real-Time Synchronization , 1990, IEEE Trans. Computers.

[5]  Alireza Ejlali,et al.  A Comparative Study of System-Level Energy Management Methods for Fault-Tolerant Hard Real-Time Systems , 2011, IEEE Transactions on Computers.

[6]  Danielle George,et al.  A system-based design methodology and architecture for highly adaptive small satellites , 2010, 2010 IEEE International Systems Conference.

[7]  Michele Cirinei,et al.  Response-Time Analysis for Globally Scheduled Symmetric Multiprocessor Platforms , 2007, 28th IEEE International Real-Time Systems Symposium (RTSS 2007).

[8]  G. Manimaran,et al.  Efficient overloading techniques for primary-backup scheduling in real-time systems , 2004, J. Parallel Distributed Comput..

[9]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[10]  Brian Randell,et al.  System structure for software fault tolerance , 1975, IEEE Transactions on Software Engineering.

[11]  Shefali Malhotra,et al.  A Review Of Fault Tolerant Scheduling In Multicore Systems , 2015 .

[12]  Theodore P. Baker.  Comparison of Empirical Success Rates of Global vs. Partitioned Fixed-Priority and EDF Scheduling for Hard Real Time TR-050601 , 2005 .

[13]  Tongquan Wei,et al.  Fault-Tolerant Task Scheduling for Mixed-Criticality Real-Time Systems , 2017, J. Circuits Syst. Comput..

[14]  Rami G. Melhem,et al.  Fault-Tolerance Through Scheduling of Aperiodic Tasks in Hard Real-Time Multiprocessor Systems , 1997, IEEE Trans. Parallel Distributed Syst..

[15]  C. Siva Ram Murthy,et al.  A Fault-Tolerant Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems and Its Analysis , 1998, IEEE Trans. Parallel Distributed Syst..

[16]  Giuseppe Lipari,et al.  A Flexible Scheme for Scheduling Fault-Tolerant Real-Time Tasks on Multiprocessors , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[17]  Xiaohui Hu,et al.  A Fault-Tolerant Scheduling Algorithm using Hybrid Overloading Technology for Dynamic Grouping based Multiprocessor Systems , 2012, Int. J. Comput. Commun. Control.

[18]  Björn Andersson,et al.  Resource Sharing in Global Fixed-Priority Preemptive Multiprocessor Scheduling , 2009, 2009 30th IEEE Real-Time Systems Symposium.