Abstract
We propose an approach to build fault-tolerant distributed real-time embedded systems. From a given system description (application algorithm and architecture) and a given fault hypothesis (type and number of faults to be tolerated), we generate automatically a static fault-tolerant multiprocessor schedule of the algorithm components on the target architecture, which minimizes the schedule length, and tolerates transient faults of both processors and communication media. Our approach is dedicated to heterogeneous architectures with multiple processors linked by several shared buses. It is based on hybrid redundancy and data fragmentation strategies, which allow fast fault detection and handling. This scheduling problem is NP-hard and we rely on a heuristic algorithm to obtain efficiently an approximate solution. Our simulation results show that our approach generally reduces the schedule length overhead.
Chapter PDF
Similar content being viewed by others
Keywords
REFERENCES
P. Jalote. Fault-Tolerance in Distributed Systems. Prentice Hall, Englewood Cliffs, New Jersey, 1994.
K. Hashimoto, T. Tsuchiya, and T. Kikuno. Effective scheduling of duplicated tasks for fault-tolerance in multiprocessor systems. IEICE Trans. on Information and Systems, E85-D(3):525–534, March 2002.
A. Girault, H. Kalla, M. Sighireanu, and Y. Sorel. An algorithm for automatically obtaining distributed and fault-tolerant static schedules. In International Conference on Dependable Systems and Networks, DSN’03, San-Francisco, USA, June 2003. IEEE.
K. Ahn, J. Kim, and S. Hong. Fault-tolerant real-time scheduling using passive replicas. In Pacific Rim International Symposium on Fault-Tolerant Systems, Taipei, Taiwan, December 1997.
X. Qin, H. Jiang, and D. R. Swanson. An efficient fault-tolerant scheduling algorithm for real-time tasks with precedence constraints in heterogeneous systems. In International Conference on Parallel Processing, pages 360–386, Vancouver, Canada, August 2002.
Y. Oh and S. H. Son. Scheduling real-time tasks for dependability. Journal of Operational Research Society, 48(6):629–39, June 1997.
N. Kandasamy, J.E Hayes, and B.T. Murray. Dependable communication synthesis for distributed embedded systems. In International Conference on Computer Safety, Reliability and Security, SAFECOMP’ 03, Edinburgh, UK, September 2003.
S. Duhnan, T. Nieberg, J. Wu, and E. Havinga. Trade-off between traffic overhead and reliability in multipath routing for wireless sensor networks. In Wireless Communications and Networking Conference, 2003.
B. Kao, H. Garcia-Molina, and D. Barbara. Aggressive transmissions of short messages over redundant paths. IEEE Trans. on Parallel and Distributed Systems, 5(1):102–109, January 1994.
H. Kopetz and G. Bauer. The time-triggered architecture. Proceedings of the IEEE, 91(1): 112–126, October 2003.
C. Dima, A. Girault, and Y. Sorel. Static fault-tolerant scheduling with “pseudotopological” orders. In Joint Conference FORMATS-FTRTFT’04, volume 3253 of LNCS, Grenoble, France, September 2004. Springer-Verlag.
R. Vaidyanathan and S. Nadella. Fault-tolerant multiple bus networks for fan-in algorithms. In International Parallel Processing Symposium, pages 674–681, April 1996.
M. Pizza, L. Strigini, A. Bondavalli, and F. Di Giandomenico. Optimal discrimination between transient and permanent faults. In 3rd IEEE High Assurance System Engineering Symposium, pages 214–223, Bethesda, MD, USA, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Girault, A., Kalla, H., Sorel, Y. (2006). Transient Processor/Bus Fault Tolerance for Embedded Systems. In: Kleinjohann, B., Kleinjohann, L., Machado, R.J., Pereira, C.E., Thiagarajan, P.S. (eds) From Model-Driven Design to Resource Management for Distributed Embedded Systems. DIPES 2006. IFIP International Federation for Information Processing, vol 225. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-39362-9_15
Download citation
DOI: https://doi.org/10.1007/978-0-387-39362-9_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-39361-2
Online ISBN: 978-0-387-39362-9
eBook Packages: Computer ScienceComputer Science (R0)