A Flexible Scheme for Scheduling Fault-Tolerant Real-Time Tasks on Multiprocessors

The recent introduction of multicore system-on-a-chip architectures for embedded systems opens a new range of possibilities for both increasing the processing power and improving the fault-robustness of real-time embedded applications. Fault-tolerance and performance are often contrasting requirements. Techniques to improve robustness to hardware faults are based on replication of hardware and/or software. Conversely, techniques to improve performance are based on exploiting inherent parallelism of multiprocessor architectures. In this paper, we propose a technique that allows the user to trade-off parallelism with fault-tolerance in a multicore hardware architecture. Our technique is based on a combination of hardware mechanisms and real-time operating system mechanisms. In particular, we apply hierarchical scheduling techniques to efficiently support fault-tolerant, fault-silent and non-fault-tolerant tasks in the same system.

[1]  George Marconi de Araujo Lima,et al.  Fault tolerance in fixed-priority hard real-time distributed systems , 2003 .

[2]  Aloysius K. Mok,et al.  A model of hierarchical real-time virtual resources , 2002, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002..

[3]  Giorgio C. Buttazzo,et al.  Optimal scheduling for fault-tolerant and firm real-time systems , 1998, Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236).

[4]  Luís Almeida,et al.  Scheduling within temporal partitions: response-time analysis and server design , 2004, EMSOFT '04.

[5]  Giorgio C. Buttazzo,et al.  Schedulability analysis of periodic fixed priority systems , 2004, IEEE Transactions on Computers.

[6]  Jean-Yves Le Boudec,et al.  Application of Network Calculus to Guaranteed Service Networks , 1998, IEEE Trans. Inf. Theory.

[7]  Insup Lee,et al.  Periodic resource model for compositional real-time guarantees , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[8]  Alberto L. Sangiovanni-Vincentelli,et al.  Fault-tolerant platforms for automotive safety-critical applications , 2003, CASES '03.

[9]  Daniel F. García,et al.  Utilization Bounds for Multiprocessor Rate-Monotonic Scheduling , 2004, Real-Time Systems.

[10]  Sanjoy K. Baruah,et al.  Partitioning real-time tasks among heterogeneous multiprocessors , 2004, International Conference on Parallel Processing, 2004. ICPP 2004..

[11]  R. Baumann Soft errors in advanced semiconductor devices-part I: the three radiation sources , 2001 .

[12]  Wilton R. Abbott,et al.  Network Calculus , 1970 .

[13]  James H. Anderson,et al.  Optimal rate-based scheduling on multiprocessors , 2002, STOC '02.

[14]  Giuseppe Lipari,et al.  A methodology for designing hierarchical scheduling systems , 2005, J. Embed. Comput..

[15]  Rami G. Melhem,et al.  Analysis of a fault-tolerant multiprocessor scheduling algorithm , 1994, Proceedings of IEEE 24th International Symposium on Fault- Tolerant Computing.

[16]  Lorenzo Alvisi,et al.  Modeling the effect of technology trends on the soft error rate of combinational logic , 2002, Proceedings International Conference on Dependable Systems and Networks.

[17]  G. Lipari,et al.  The Design Domain of Real-Time Systems by Enrico Bini Ph , 2004 .

[18]  BiniEnrico,et al.  Schedulability Analysis of Periodic Fixed Priority Systems , 2004 .

[19]  Jean-Yves Le Boudec,et al.  Network Calculus: A Theory of Deterministic Queuing Systems for the Internet , 2001 .

[20]  Philip A. Bernstein,et al.  Sequoia: a fault-tolerant tightly coupled multiprocessor for transaction processing , 1988, Computer.

[21]  Sasikumar Punnekkat,et al.  Schedulability analysis for fault tolerant real-time systems , 1997 .

[22]  M. Garc Utilization bounds for Multiprocessor Rate-Monotonic Scheduling , 2000 .

[23]  Jean-Yves Le Boudec,et al.  Network Calculus , 2001, Lecture Notes in Computer Science.