Abstract : We propose to handle execution duration overruns (temporal faults) in real-time embedded systems. When a temporal fault occurs, the slack time can be dynamically determined and assigned to the faulty task in order to complete its treatment. This mechanism improves the temporal robustness of real-time systems. We demonstrate that an approximate slack stealer algorithm like the MASS algorithm is a good solution for real-time embedded systems. We validate the feasibility of this approach by an implementation on the Lego Mindstorm NXT platform.
https://hal-upec-upem.archives-ouvertes.fr/hal-00619771 Contributor : Damien MassonConnect in order to contact the contributor Submitted on : Wednesday, October 26, 2011 - 5:17:03 PM Last modification on : Saturday, January 15, 2022 - 3:56:39 AM Long-term archiving on: : Thursday, November 15, 2012 - 10:37:37 AM
Serge Midonnet, Damien Masson, Rémi Lassalle. Slack-Time Computation for Temporal Robustness in Embedded Systems. IEEE Embedded Systems Letters, Institute of Electrical and Electronics Engineers, 2010, 2 (4), pp.119-122. ⟨hal-00619771⟩