Response Time Analysis of the Abort-and-Restart Model under Symmetric Multiprocessing

Ras, Jim; Cheng, Albert M. K.

doi:10.1109/cit.2010.332

Cited by 8 publications

(2 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In global scheduling, the primary and backups are not statically allocated to any core; rather the primary and the backups are dispatched for execution on any free core even after preemptions. Unlike the abort-and-restart model of computation (Wong and Burns 2014;Ras and Cheng 2010), the preempted tasks continue their execution once higher priority tasks complete execution 2 . The proposed FTM algorithm in this paper is designed based on the following two simple strategies applied to global multicore scheduling:…”

Section: Fault-tolerant Real-time Schedulingmentioning

confidence: 99%

“…Tasks are assumed to be independent, i.e., the only resource they share is the CPU time. However, the proposed approach of this paper can be extended for other shared resources, for example, based on abort-and-restart model of computation (Wong and Burns 2014;Ras and Cheng 2010). The real-time constraint is that if a job of task τ i released at time r , then the job must generate its output before its deadline which is at time (r + D i ).…”

Section: Introductionmentioning

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: Fault-tolerant Real-time Schedulingmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%