Sökning: onr:"swepub:oai:research.chalmers.se:10036afb-65af-47c1-bd8d-ff4c7a0e3e68" >
An automated perfor...
An automated performance-aware approach to reliability transformations
-
- Lidman, Jacob, 1985 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
- McKee, Sally A, 1963 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
- Quinlan, D. J. (författare)
- Lawrence Livermore National Laboratory
-
visa fler...
-
- Liao, C. (författare)
- Lawrence Livermore National Laboratory
-
visa färre...
-
(creator_code:org_t)
- ISBN 9783319143248
- Cham : Springer International Publishing, 2014
- 2014
- Engelska.
-
Ingår i: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - Cham : Springer International Publishing. - 1611-3349 .- 0302-9743. - 9783319143248 ; 8805:Part 1, s. 523-534
- Relaterad länk:
-
http://dx.doi.org/10...
-
visa fler...
-
https://link.springe...
-
https://doi.org/10.1...
-
https://research.cha...
-
visa färre...
Innehållsförteckning
Abstract
Ämnesord
Stäng
No table of content available
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences (hsv//eng)
Nyckelord
- High performance computing
- Reliability optimization
- Fault tolerance
- N-Modular redundancy
Publikations- och innehållstyp
- kon (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas