Overhead Reduction in Data-Flow Software-Based Fault Tolerance Techniques

Data Error Detection and Recovery in Embedded Systems: a Literature Review

“…The introduced soft errors can corrupt the data of the program in execution. To counter this data corruption, a number of data flow error detection and recovery techniques have been proposed in literature [1,7,8,[12][13][14][15][16][17][19][20][21]. In previous work [4], we listed several data flow error detection techniques and discussed their reported results.…”

“…A number of data flow error detection techniques have been developed based on a unique duplication mechanism for better fault coverage or lower overhead in terms of memory consumption. The duplication can be applied at various levels such as a full duplication and selective duplication [1,4,7,8,[12][13][14][15]17,18]. Full duplication techniques and selective code duplication techniques are discussed in Sections 2.1 and 2.2 respectively.…”

“…In order to evaluate the data error detection techniques, authors of the corresponding techniques [1,7,[12][13][14][15][16][17] have chosen various case studies for the experiments. Bubble sort, quicksort, insertion sort, and matrix multiplication are the most used case studies in previous research in this field [13,16,17,26,30].…”

“…The basic mechanism involved in all of the full duplication techniques is duplicating the entire code and comparing the original and duplicated output to detect errors. Full code duplication has been performed in different ways for different techniques as in [7,13,15,31]. Table 1.…”

“…Due to its ASTESJ ISSN: 2415-6698 flexibility and cost, software-based solutions are used in a number of applications. Software redundancy increases the system's reliability but requires extra memory space and processing time to execute redundant instructions [15]. A number of software-based data error detection and recovery techniques have been proposed and implemented in literature for fault-tolerant embedded systems [1,7,8,[12][13][14][15][16][17][18][19][20][21][22].…”