Name
Abstract | ||
|---|---|---|
The traditional approach to fault tolerant computing involves replicating computation units and applying a majority vote operation on individual result bits. This approach, however, has several limitations; the most severe is the resource requirement. This paper presents a new method for fault tolerant computing where for a given error rate, the hamming distance between correct inputs and faulty inputs as well as the hamming distance between a correct result and a faulty result is preserved throughout processing thereby enabling correction of up to transient faults per computation cycle. The new method is compared and contrasted with current protection methods and its cost / performance is analyzed. |
Year | Venue | Keywords |
|---|---|---|
2011 | Clinical Orthopaedics and Related Research | hardware architecture,fault tolerant,majority voting,error rate,hamming distance |
Field | DocType | Volume |
Hamming code,Computer science,Word error rate,Operand,Arithmetic,Algorithm,Real-time computing,Hamming distance,Fault tolerance,Majority rule,Computation | Journal | abs/1104.3 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shlomi Dolev | 1 | 2962 | 260.61 |
| Sergey Frenkel | 2 | 5 | 3.17 |
| Dan E. Tamir | 3 | 79 | 13.26 |