Name
Abstract | ||
|---|---|---|
Soft errors are expected to increase as feature sizes shrink and the number of cores increases. Redundant execution can be used to cope with such errors. This paper deals with the problem of automatically finding the number of redundant executions needed to achieve a preset reliability threshold. Our method uses geometric programming to calculate the minimal reliability for each instruction while still ensuring that the reliability of the program satisfies a given threshold. We use this to approximate an upper bound on the number of redundant instructions. Using this, we perform a limit study to find the implications of different redundant execution schemes. In particular we notice that the overhead of higher redundancy has serious implications to reliability. We therefore create a scheme where we only perform more executions if needed. Applying the results from our optimization improves reliability by up to 58.25%. We show that it is possible to achieve up to 8% better performance than Triple Modular Redundancy (TMR). We also show cases where our approach is insufficient. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-319-14325-5_45 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
High Performance Computing,Fault Tolerance,N-Modular Redundancy,Reliability Optimization | Supercomputer,Upper and lower bounds,Computer science,Parallel computing,Triple modular redundancy,Redundancy (engineering),Fault tolerance,Dual modular redundancy,Geometric programming,Distributed computing,Reliability optimization | Conference |
Volume | ISSN | Citations |
8805 | 0302-9743 | 1 |
PageRank | References | Authors |
0.35 | 10 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jacob Lidman | 1 | 15 | 1.99 |
| Sally A. Mckee | 2 | 1928 | 152.59 |
| Daniel J. Quinlan | 3 | 652 | 80.13 |
| Chunhua Liao | 4 | 330 | 30.72 |