2015 11th European Dependable Computing Conference (EDCC) 2015
DOI: 10.1109/edcc.2015.32
|View full text |Cite
|
Sign up to set email alerts
|

Toward a Fault-Tolerance Framework for COTS Many-Core Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
14
0

Year Published

2016
2016
2018
2018

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(14 citation statements)
references
References 13 publications
0
14
0
Order By: Relevance
“…In case of failures, instead of task remapping to sustain the number of redundant tasks, the authors propose to preserve the mapping and adjust the functionality of the included voter task. N Modular Redundancy (NMR) is the main fault tolerance mechanism in [28], targetting commercial many-core SoCs such as [3]. Transient faults in PEs are encountered by comparing the output of the N-times replicated task and repairing any instance that exhibits output divergence.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…In case of failures, instead of task remapping to sustain the number of redundant tasks, the authors propose to preserve the mapping and adjust the functionality of the included voter task. N Modular Redundancy (NMR) is the main fault tolerance mechanism in [28], targetting commercial many-core SoCs such as [3]. Transient faults in PEs are encountered by comparing the output of the N-times replicated task and repairing any instance that exhibits output divergence.…”
Section: Related Workmentioning
confidence: 99%
“…To mitigate such silent errors, the designer can take advantage of our proposed hierarchical design, in order to employ fault resilient deployment of the application, e.g. redundant execution of its tasks [28,29].…”
Section: Target Application Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…To guarantee hard real-time constraints during task migration, a methodology is proposed in [23]. However, a costly schedulability analysis is performed during run-time.…”
Section: Related Workmentioning
confidence: 99%
“…Similarly to [23], we split a runnable's context into two parts: (i) invariant, which is not modified at run-time and (ii) dynamic, including all volatile memory locations. We assume that an upper bound of the dynamic part size of all runnables is known in advance.…”
Section: Application Modelmentioning
confidence: 99%