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) -
Fault-tolerant scheduling algorithm for real-time tasks in virtualized cloud
by: Ji WANG, et al.
Published: (2014-10-01) -
Trust-driven job scheduling heuristics for computing grid
by: ZHANG Wei-zhe1, et al.
Published: (2006-01-01) -
Interval-Aware Scheduling of Surveillance Drones: Exact and Heuristic Approaches
by: Kaito Mori, et al.
Published: (2025-01-01) -
Fault tolerant & priority basis task offloading and scheduling model for IoT logistics
by: Asif Umer, et al.
Published: (2025-01-01)