Voter insertion algorithms for FPGA designs using triple modular redundancy
Authors:
Open Access
- 21 February 2010
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 249-258
Abstract
Triple Modular Redundancy (TMR) is a common reliability technique for mitigating single event upsets (SEUs) in FPGA designs operating in radiation environments. For FPGA systems that employ configuration scrubbing, majority voters are needed in all feedback paths to ensure proper synchronization between the TMR replicates. Synchronization voters, however, consume additional resources and impact system timing. This paper will introduce and contrast four algorithms for inserting synchronization voters while automatically performing TMR. The area cost and timing impact of each algorithm on a number of circuit benchmarks will be reported. This paper will demonstrate that one of the algorithms provides the best overall timing performance results with an average 9.8% increase in critical path length over a triplicated design without voters. Another algorithm provides far better area results at a slightly higher timing cost (an average 2.1% area increase over a triplicated design without voters).Keywords
This publication has 7 references indexed in Scilit:
- On-Orbit Flight Results from the Reconfigurable Cibola Flight Experiment Satellite (CFESat)2009
- Fault Tolerant ICAP Controller for High-Reliable Internal Scrubbing2008
- Improving FPGA Design Robustness with Partial TMR2006
- Approximating Minimum Feedback Sets and Multicuts in Directed GraphsAlgorithmica, 1998
- A fast and effective heuristic for the feedback arc set problemInformation Processing Letters, 1993
- A strong-connectivity algorithm and its applications in data flow analysisComputers & Mathematics with Applications, 1981
- Depth-first search and linear graph algorithms1971