Slack-Time Computation for Temporal Robustness in Embedded Systems - Archive ouverte HAL Access content directly
Journal Articles IEEE Embedded Systems Letters Year : 2010

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.
Fichier principal
Vignette du fichier
article_sans_style.pdf (165.44 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00619771 , version 1 (26-10-2011)

Identifiers

  • HAL Id : hal-00619771 , version 1

Cite

Serge Midonnet, Damien Masson, Rémi Lassalle. Slack-Time Computation for Temporal Robustness in Embedded Systems. IEEE Embedded Systems Letters, 2010, 2 (4), pp.119-122. ⟨hal-00619771⟩
248 View
364 Download

Share

Gmail Facebook X LinkedIn More