Change search
ReferencesLink to record
Permanent link

Direct link
Mapping of Fault-Tolerant Applications with Transparency on Distributed Embedded Systems
Computer and Information Science Dept., Linköping University, Sweden.ORCID iD: 0000-0003-1768-6697
2006 (English)Conference paper (Refereed)
Abstract [en]

In this paper we present an approach for the mapping optimization of fault-tolerant embedded systems for safetycritical applications. Processes and messages are statically scheduled. Process re-execution is used for recovering from multiple transient faults. We call process recovery transparent if it does not affect operation of other processes. Transparent recovery has the advantage of fault containment, improved debugability and less memory needed to store the fault-tolerant schedules. However, it will introduce additional delays that can lead to violations of the timing constraints of the application. We propose an algorithm for the mapping of fault-tolerant applications with transparency. The algorithm decides a mapping of processes on computation nodes such that the application is schedulable and the transparency properties imposed by the designer are satisfied. The mapping algorithm is driven by a heuristic that is able to estimate the worst-case schedule length and indicate whether a certain mapping alternative is schedulable.


Place, publisher, year, edition, pages
2006. 313-320 p.
National Category
Mechanical Engineering
URN: urn:nbn:se:kth:diva-179565OAI: diva2:884068
9th Euromicro Conference on Digital System Design, Cavtat near Dubrovnik, Croatia.

QC 20160120

Available from: 2015-12-17 Created: 2015-12-17 Last updated: 2016-01-20Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Izosimov, Viacheslav
Mechanical Engineering

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 16 hits
ReferencesLink to record
Permanent link

Direct link