A probabilistic analysis of resilient reconfigurable designs
Alirad Malek (Chalmers University of Technology)
Stavros Tzilis (Chalmers University of Technology)
D.A. Khan (Chalmers University of Technology)
I. Sourdis (Chalmers University of Technology)
G. Smaragdos (Erasmus MC)
Christos Strydis (Erasmus MC)
More Info
expand_more
Abstract
Reconfigurable hardware can be employed to tolerate permanent faults. Hardware components comprising a System-on-Chip can be partitioned into a handful of substitutable units interconnected with reconfigurable wires to allow isolation and replacement of faulty parts. This paper offers a probabilistic analysis of reconfigurable designs estimating for different fault densities the average number of fault-free components that can be constructed as well as the probability to guarantee a particular availability of components. Considering the area overheads of reconfigurability, we evaluate the resilience of various reconfigurable designs with different granularities. Based on this analysis, we conduct a comprehensive design-space exploration to identify the granularity mixes that maximize the fault-tolerance of a system. Our findings reveal that mixing fine-grain logic with a coarse-grain sparing approach tolerates up to 3× more permanent faults than component redundancy and 2× more than any other purely coarse-grain solution. Component redundancy is preferable at low fault densities, while coarse-grain and mixed-grain reconfigurability maximize availability at medium and high fault densities, respectively.
No files available
Metadata only record. There are no files for this record.