Referenced Items are not available for this document.
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 minimal approximate slack stealer (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.
Published in:
Embedded Systems Letters, IEEE
(Volume:2
,
Issue:
4
)
Date of Publication: Dec. 2010
- Page(s):
- 119 - 122
- ISSN :
- 1943-0663
- INSPEC Accession Number:
- 11698523
- Digital Object Identifier :
- 10.1109/LES.2010.2074184
- Product Type:
- Journals & Magazines
- Date of Publication :
- 09 September 2010
- Date of Current Version :
- 20 December 2010
- Issue Date :
- Dec. 2010
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
