A High-Level Synthesis Scheduling and Binding Heuristic for FPGA Fault Tolerance
Computing systems with field-programmable gate arrays (FPGAs) often achieve fault tolerance in high-energy radiation environments via triple-modular redundancy (TMR) and configuration scrubbing. Although effective, TMR suffers from a 3x area overhead, which can be prohibitive for many embedded usage...
Saved in:
Main Authors: | David Wilson, Aniruddha Shastri, Greg Stitt |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2017-01-01
|
Series: | International Journal of Reconfigurable Computing |
Online Access: | http://dx.doi.org/10.1155/2017/5419767 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Fault Tolerant PLBGSA: Precedence Level Based Genetic Scheduling Algorithm for P2P Grid
by: Piyush Chauhan, et al.
Published: (2013-01-01) -
Hyper-Heuristics and Scheduling Problems: Strategies, Application Areas, and Performance Metrics
by: Alonso Vela, et al.
Published: (2025-01-01) -
Empirical Mode Decomposition and Neural Networks on FPGA for Fault Diagnosis in Induction Motors
by: David Camarena-Martinez, et al.
Published: (2014-01-01) -
A Hybrid Heuristic Algorithm for Ship Block Construction Space Scheduling Problem
by: Shicheng Hu, et al.
Published: (2015-01-01) -
Massive Sensor Array Fault Tolerance: Tolerance Mechanism and Fault Injection for Validation
by: Dugan Um
Published: (2010-01-01)