Tolerance to multiple transient faults for aperiodic tasks in hard real-time systems

Liberato, Frank; Melhem, Rami; Mossé, Daniel

doi:10.1109/12.869322

Cited by 61 publications

(60 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The authors also extend this linear-time heuristic to jobs with arbitrary release times, and discuss its applications and experimental results. A different fault frequency model, in which the number of faults is bounded by some constant k, has been suggested by Liberato, Melhem and Mossé [LMM00]. For this model, the authors give a O(n 2 k)-time dynamic programming algorithm for testing fault-tolerance if jobs are ordered according to EDF and preemption is allowed.…”

Section: Introductionmentioning

confidence: 99%

“…On this paper, the jobs are allready ordered, and preemption is not allowed. We consider both fault frequency models from [GMM95, MMG03,LMM00] in this paper. In addition to the hidden faults, we also consider another type of faults that we call exposed.…”

Section: Introductionmentioning

confidence: 99%

“…In [Ayd04] the fault model from [LMM00] is extended so that a reexecution of a job could take time different from its processing time. Our algorithm can be adapted to handle a similar case as well.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Fast Algorithms for Testing Fault-Tolerance of Sequenced Jobs with Deadlines

Melhem

Mossé

2007

28th IEEE International Real-Time Systems Symposium (RTSS 2007)

View full text Add to dashboard Cite

In queue-based scheduling systems jobs are executed according to a predefined sequential plan; faults may occur that cause jobs to re-execute thus delaying the whole schedule. It is, therefore, important to be able to determine (in real-time) whether a set of preordered jobs will always meet their deadlines: it allows for instance to decide online whether to admit a new urgent job in the queue and still guaranty that the whole schedule remains fault-tolerant, i.e. that the remaining jobs still will not miss their deadlines. Our goal in this work is therefore to efficiently test whether a given set of sequenced jobs can tolerate transient faults. We consider different realistic fault models specifying which fault patterns are allowed and how soon failed jobs can be restarted. For each fault model considered we provide efficient algorithms that, given a set of sequenced jobs, decide on the feasibility of all the jobs in the schedule. Our algorithms are exact and run in time linear in the number of jobs and thus can be used to make a real-time decision.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Fast Algorithms for Testing Fault-Tolerance of Sequenced Jobs with Deadlines

Melhem

Mossé

2007

28th IEEE International Real-Time Systems Symposium (RTSS 2007)

View full text Add to dashboard Cite

show abstract

“…A different fault frequency model, in which the number of faults is bounded by some constant k, has been suggested by Liberato et al (2000). For this model, the authors give an O(n 2 k)-time dynamic programming algorithm for testing fault-tolerance, if jobs are ordered according to EDF and preemption is allowed.…”

Section: Introductionmentioning

confidence: 99%

“…We consider both fault frequency models from (Ghosh et al 1995;Mosse et al 2003;Liberato et al 2000) in this paper. In addition to the hidden faults, we also consider another type of faults that we call exposed.…”

Section: Introductionmentioning

confidence: 99%

Algorithms for testing fault-tolerance of sequenced jobs

Chrobák

Hurand

Sgall

2009

J Sched

View full text Add to dashboard Cite

We study the problem of testing whether a given set of sequenced jobs can tolerate transient faults. We present efficient algorithms for this problem in several fault models. A fault model describes what types of faults are allowed and specifies assumptions on their frequency. Two types of faults are considered: hidden faults, that can only be detected after a job completes, and exposed faults, that can be detected immediately.First, we give an O(n)-time fault-tolerance testing algorithm, for both exposed and hidden faults, if the number of faults does not exceed a given parameter k.Then we consider the model in which any two faults are separated in time by a gap of length at least Δ, where Δ is at least twice the maximum job length. then this algorithm's expected running time is O(n). Our experimental study shows that this linear-time performance extends to other distributions. Finally, we provide evidence that improving the worst-case performance may not be possible, by proving an Ω(n 2 ) lower bound, in the algebraic computation tree model, on a slight generalization of this problem.

show abstract

Improving phasor data concentrators reliability for smart grid

Chen

Qiu

Zhu

et al. 2013

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Phasor data concentrators (PDCs) are the critical components of a wide area monitoring system (WAMS) in the smart grid. They are multi‐processor devices employed to collect, concentrate, and synchronize phasor data that is from various phasor measurement units and from other PDCs. Because of their present significance and potential criticality for WAMS, reliability of PDCs has become a high priority problem. In this paper, we first formally model the reliability problem on PDCs. Then, we propose a novel task scheduling algorithm, two‐phase heuristic task scheduling, to enhance the reliability of a PDC with real‐time constraints of applications. This algorithm seamlessly integrates both tasks scheduling and reliability optimization techniques via appropriately allocate and reallocate tasks to different processors of PDCs. Experimental results show that the proposed algorithm can efficiently guarantee reliability for PDCs with real‐time constraints. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

Tolerance to multiple transient faults for aperiodic tasks in hard real-time systems

Cited by 61 publications

References 22 publications

Fast Algorithms for Testing Fault-Tolerance of Sequenced Jobs with Deadlines

Fast Algorithms for Testing Fault-Tolerance of Sequenced Jobs with Deadlines

Algorithms for testing fault-tolerance of sequenced jobs

Improving phasor data concentrators reliability for smart grid

Contact Info

Product

Resources

About