Skip to Main content Skip to Navigation
Journal articles

Slack-Time Computation for Temporal Robustness in Embedded Systems

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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-00619771
Contributor : Damien Masson <>
Submitted on : Wednesday, October 26, 2011 - 5:17:03 PM
Last modification on : Wednesday, February 26, 2020 - 7:06:05 PM
Long-term archiving on: : Thursday, November 15, 2012 - 10:37:37 AM

File

article_sans_style.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00619771, version 1

Citation

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⟩

Share

Metrics

Record views

567

Files downloads

412