Improving FPGA repair under real-time constraints

Nazar, Gabriel L.

doi:10.1016/j.microrel.2015.04.003

Cited by 13 publications

(9 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…By using FG-DMR, the paper in [11] maximizes the probability of repairing a fault within the slack time of the tasks in a real-time system. But differently from reducing MTTR, the goal is the maximization of the repair probability, thus the algorithm to choose the best starting frame is different.…”

Section: Related Workmentioning

confidence: 99%

“…However, just as a real-time system is normally more concerned with worst-case execution time than with average execution time, the mechanism herein proposed aims at maximizing the repair probability within a given timeframe, rather than minimizing the MTTR. As in [11], the expression "target repair time" will be used meaning the remaining slack time, which is the upper bound for the time interval the repair mechanism has to repair the circuit and not create a deadline violation.…”

Section: Challengesmentioning

confidence: 99%

“…The basic idea behind shifted scrubbing is that, by starting the scrubbing operation at an appropriately chosen frame, the repair time will be smaller than that of the standard technique. The approach herein proposed attempts to dynamically choose an improved starting frame without the need for costly fine-grained checkers as in [6,7,11]. To illustrate the concept of shift scrubbing, the following histogram for an arbitrary signature of the pdc benchmark circuit is shown (Fig.…”

Section: Shifted Scrubbingmentioning

confidence: 99%

“…As the PST is not implementable for circuits with long signatures (or it may be excessively costly), a heuristic to compact the signatures to manageable sizes is needed. In this paper we will use the heuristic presented in [11] to create a Real-time Heuristic Signature Translator (RHST).…”

Section: Signature Translatormentioning

confidence: 99%

“…Once maxSize is reached, the final compressed signature is used to build a table of much reduced dimensions, when compared to the PST. For more details on the compression heuristic, please refer to [11].…”

Section: Real-time Heuristic Signature Translatormentioning

confidence: 99%

See 4 more Smart Citations

Low Cost Dynamic Scrubbing for Real-Time Systems

Santos

Nazar

Carro

2016

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Field-programmable gate arrays (FPGAs) offer several desirable characteristics, such as high speed and flexibility. These characteristics come at a cost, however, as high performance FPGAs use SRAM-based configuration memories that are susceptible to Single Event Upsets (SEUs). The conventional approach is to use some form of redundancy with a periodic scrubbing of the configuration memory, thus removing accumulated SEUs. In this paper we propose a novel approach to scrubbing FPGAs in real-time systems, by using diagnostic information based only on the primary outputs of the circuits, in the form of a coarse-grained DMR, and a specialized scrubbing mechanism to avoid missing real-time deadlines.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Challengesmentioning

confidence: 99%