Transparent recovery from intermittent faults in time-triggered distributed systems

Kandasamy, Nagarajan; Hayes, John P.; Murray, B.T.

doi:10.1109/tc.2003.1176980

Cited by 76 publications

(68 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many interesting table-driven fault-tolerant scheduling are addressed in Girault et al (2003), Isovic and Fohler (2000), Pop et al (2009), Kandasamy et al (2003). The scheduling table for each processor is generated offline, which sometimes could be challenging if task parameters are 'badly' related.…”

Section: Related Workmentioning

confidence: 99%

“…In their approach, if the generated schedule is not fault-tolerant, then the schedule is discarded and new schedule is re-generated. However, Kandasamy et al (2003) avoid this by directly generating the time-triggered fault-tolerant schedule. Pop et al (2009) considered overhead-aware check-pointing for fault-tolerance in time-triggered scheduling.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Real-time scheduling algorithm for safety-critical systems on faulty multicore environments

Pathan

2016

Real-Time Syst

View full text Add to dashboard Cite

An algorithm (called FTM) for scheduling of real-time sporadic tasks on a multicore platform is proposed. Each task has a deadline by which it must complete its non-erroneous execution. The FTM algorithm executes backups in order to recover from errors caused by non-permanent and permanent hardware faults. The worst-case schedulability analysis of FTM algorithm is presented considering an applicationlevel error model, which is independent of the stochastic behavior of the underlying hardware-level fault model. Then, the stochastic behavior of hardware-level fault model is plugged in to the analysis to derive the probability of meeting all the deadlines. Such probabilistic guarantee is the level of assurance (i.e., reliability) regarding the correct functional and timing behaviors of the system. One of the salient features of FTM algorithm is that it executes some backups in active redundancy to exploit the parallel multicore architecture while other backups passively to avoid unnecessary execution of too many active backups. This paper also proposes a scheme to determine for each task the number of backups that should run in active redundancy in order to increase the probability of meeting all the deadlines. The effectiveness of the proposed approach is demonstrated using an example application.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Real-time scheduling algorithm for safety-critical systems on faulty multicore environments

Pathan

2016

Real-Time Syst

View full text Add to dashboard Cite

show abstract

“…We have generalized the fault-model from [14] that assumes that one single transient fault may occur on any of the nodes in the system during the application execution. In our model, we consider that at most k transient faults 1 may occur anywhere in the system during one operation cycle of the application.…”

Section: Hardware Architecture and Fault Modelmentioning

confidence: 99%

“…The process model in [9] supports the application of checkpoints, while [19] has proposed a high-level synthesis algorithm for ASICs that introduces low overhead checkpoints in a static schedule. When re-execution (which can be equated to a single-checkpoint scheme) is used in a distributed system, Kandasamy [14] proposes a list-scheduling technique for building a static schedule that can mask the occurrence of faults, thus making the re-execution transparent. Slacks are inserted into the schedule in order to allow the re-execution of processes in case of faults.…”

Section: Introductionmentioning

confidence: 99%

“…Very few researchers [14,19,20] consider the optimization of implementations to reduce the overheads due to fault-tolerance and, even if optimization is considered, it is very limited and does not include the concurrent usage of several fault-tolerance techniques. Moreover, the application of faulttolerance techniques is considered in isolation, and thus is not considered in relation to other levels of the design process, including mapping, scheduling and bus access optimization.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Synthesis of fault-tolerant embedded systems with checkpointing and replication

Izosimov

Pop

Eles

et al. 2006

Third IEEE International Workshop on Electronic Design, Test and Applications (DELTA'06)

View full text Add to dashboard Cite

show abstract

Hybrid gain performance‐based random event‐triggered filter of positive semi‐Markovian jump systems with intermittent sensor faults

Zhang

Zheng

2021

Intl J Robust & Nonlinear

View full text Add to dashboard Cite

This article proposes a new random event-triggering scheme to design filter of positive semi-Markovian jump systems with intermittent sensor faults. To obtain a balance of saving network resources and improving system performance, a random event-triggering mechanism consisting of time-and event-triggering modes is constructed. A Bernoulli distribution-based stochastic variable is introduced to orchestrate the switching of two triggering modes. A concept of hybrid gain performance is presented to guarantee that the filter can attenuate the affect from the disturbance and sensor faults. Then, a random event-triggered filter is designed for positive semi-Markovian jump systems subject to intermittent sensor faults. Under the designed filter, hybrid gain performance is achieved. Furthermore, the proposed approach is extended to the systems with stochastically incorrect sensor measurement. A linear programming method is employed for describing and computing the presented conditions. Finally, the validity of the results is verified via two examples.

show abstract

Transparent recovery from intermittent faults in time-triggered distributed systems

Cited by 76 publications

References 29 publications

Real-time scheduling algorithm for safety-critical systems on faulty multicore environments

Real-time scheduling algorithm for safety-critical systems on faulty multicore environments

Synthesis of fault-tolerant embedded systems with checkpointing and replication

Hybrid gain performance‐based random event‐triggered filter of positive semi‐Markovian jump systems with intermittent sensor faults

Contact Info

Product

Resources

About