liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Mapping of Fault-Tolerant Applications with Transparency on Distributed Embedded Systems
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory.
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory.
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory.
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory.
2006 (English)In: 9th Euromicro Conference on Digital System Design,2006, Dubrovnik: IEEE Computer Society Press , 2006, 313- p.Conference paper, Published paper (Refereed)
Abstract [en]

In this paper we present an approach for the mapping optimization of fault-tolerant embedded systems for safety-critical 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
Dubrovnik: IEEE Computer Society Press , 2006. 313- p.
Keyword [en]
embedded systems, real-time systems, fault tolerance, transient faults, design optimization, mapping, conditional scheduling
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-35469DOI: 10.1109/DSD.2006.65Local ID: 26946ISBN: 0-7695-2609-8 (print)OAI: oai:DiVA.org:liu-35469DiVA: diva2:256317
Conference
9th Euromicro Conference on Digital System Design,2006
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2013-08-16

Open Access in DiVA

No full text

Other links

Publisher's full texthttp://www.ida.liu.se/labs/eslab/publications/pap/db/viaiz_dsd06.corrected.pdf

Authority records BETA

Izosimov, ViacheslavPop, PaulEles, Petru IonPeng, Zebo

Search in DiVA

By author/editor
Izosimov, ViacheslavPop, PaulEles, Petru IonPeng, Zebo
By organisation
The Institute of TechnologyESLAB - Embedded Systems Laboratory
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 142 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf