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.
Type de document :
Article dans une revue
IEEE Embedded Systems Letters, Institute of Electrical and Electronics Engineers, 2010, 2 (4), pp.119-122
https://hal-upec-upem.archives-ouvertes.fr/hal-00619771
Contributeur : Damien Masson
<>
Soumis le : mercredi 26 octobre 2011 - 17:17:03
Dernière modification le : mercredi 4 juillet 2018 - 16:38:05
Document(s) archivé(s) le : jeudi 15 novembre 2012 - 10:37:37
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〉
