Abstract
Arithmetic error coding schemes (AN codes) are a well known and effective technique for soft error mitigation. Although coding theory being a rich area of mathematics, their implementation seems to be fairly easy. However, compliance with the theory can be lost easily while moving towards an actual implementation - finally jeopardizing the aspired fault-tolerance characteristics. In this paper, we present our experiences and lessons learned from implementing AN codes in the Cored dependable voter. We focus on the challenges and pitfalls in the transition from maths to machine code for a binary computer from a systems perspective. Our results show, that practical misconceptions (such as the use of prime numbers) and architecture-dependent implementation glitches occur on every stage of this transition. We identify typical pitfalls and describe practical measures to find and resolve them. Our measures eliminate all remaining SDCs in the Cored voter, which is validated by an extensive fault-injection campaign that covers 100 percent of the fault space for 1-bit and 2-bit errors.
| Originalsprache | Englisch |
|---|---|
| Titel des Sammelwerks | 2014 IEEE 15th International Symposium on High-Assurance Systems Engineering |
| Seiten | 33-40 |
| Seitenumfang | 8 |
| ISBN (elektronisch) | 978-1-4799-3466-9, 978-1-4799-3465-2 |
| DOIs | |
| Publikationsstatus | Veröffentlicht - 6 März 2014 |
| Extern publiziert | Ja |
| Veranstaltung | 2014 IEEE 15th International Symposium on High-Assurance Systems Engineering, HASE 2014 - Miami, FL, USA / Vereinigte Staaten Dauer: 9 Jan. 2014 → 11 Jan. 2014 |
Konferenz
| Konferenz | 2014 IEEE 15th International Symposium on High-Assurance Systems Engineering, HASE 2014 |
|---|---|
| Land/Gebiet | USA / Vereinigte Staaten |
| Ort | Miami, FL |
| Zeitraum | 9 Jan. 2014 → 11 Jan. 2014 |
ASJC Scopus Sachgebiete
- Software
Dieses zitieren
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver