Dealing with execution-overruns to improve the temporal robustness of real-time systems scheduled FP and EDF

Bougueroua, Lamine; George, Laurent; Midonnet, Serge

doi:10.1109/icons.2007.18

Cited by 13 publications

(6 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…EDF-Allowance is a EDF [18] scheduling approach which can tolerate up to 𝑘 execution time budget overruns within a sliding time window 𝑊 without deadline violations [15]. Similar to our EDF-IVD-SE, EDF-Allowance leverages static slack to account for overruns.…”

Section: B Edf-allowancementioning

confidence: 99%

“…Moreover, the lack of resources in deeply embedded systems rules out dynamic slack monitoring approaches [13] , or to precompute proper schedules for all scenarios at design time [14]. Therefore, approaches which emphasize static design time decisions over elaborate dynamic decisions during system operation are preferable, but verification-friendly state-of-the-art approaches, which resort to static slack analysis during design time [15], [16] , suffer from low acceptance rates. Hence, there is a strong need for a mixed-criticality approach for industrial fault-tolerant systems which provides degraded service to low criticality tasks, is sensible for verification, and likely finds a solution for highly loaded systems.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Implications of Non-Uniform Deadline Scaling to Quality of Service Under Single Errors

Schmidt

García-Ortiz

2022

IEEE Access

View full text Add to dashboard Cite

Fault-tolerant real-time systems for emerging critical applications like wearable electronic healthcare monitors, consumer-grade unmanned aerial vehicles, or environmental monitoring have to tolerate errors during operation. If they fail, the consequences are dire. But often their budgets for error mitigation capabilities are low, which requires to limit mitigation capabilities to the most critical functions of a system. Still, less critical functions of a system should operate as long as possible, but current state-of-the-art scheduling approaches either ignore them or suffer from low acceptance rates. Our fully static and verification friendly mixed-criticality approach guarantees mentioned systems that the most critical system functions are always available, and maximizes the time where less critical system functions are operational: We prove that our approach is feasible, and extends the system operation time while providing full service by a factor of 1.93 with a probability of 0.92. With 1.56 higher acceptance rates compared to similar state-of-the-art approaches, the integration of functionalities of different criticality in one fault-tolerant system succeeds more and more often, which especially benefits emerging critical applications with limited budgets for error mitigation.

show abstract

Section: B Edf-allowancementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Implications of Non-Uniform Deadline Scaling to Quality of Service Under Single Errors

Schmidt

García-Ortiz

2022

IEEE Access

View full text Add to dashboard Cite

show abstract

“…One of the available approach to compute the allowance of the execution duration has been proposed by Bougueroua et al [11]. For a given value of allowance A j i , this method consists in checking that the system remains schedulable when the execution duration of a task τ i is equal to…”

Section: Allowance Computed From Wcrtmentioning

confidence: 99%

Robust Partitioned Scheduling for Real-Time Multiprocessor Systems

Fauberteau¹,

Midonnet²,

George³

2010

Distributed, Parallel and Biologically Inspired Systems

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper, we consider the problem of fixed-priority partitioned scheduling of sporadic real-time tasks for homogeneous processors. We propose a partitioning heuristic that takes into account possible Worst Case Execution Time (WCET) overruns. Our goal is to maximize the duration a task can be allowed to exceed its WCET without compromising the timeliness constraints of all the tasks. This duration is denoted in the paper the allowance of the task and is computed with a sensitivity analysis. The partitioning heuristic we propose, assigns the tasks to the processors in order (i) to maximize the allowance of the tasks and (ii) to tolerate bounded execution duration overruns. Property (ii) is important as real-time applications are often prone to be subject to OS approximations or software faults that might result in execution duration overruns. We show with performance evaluations that Allowance-Fit-Decreasing partitioning improves the temporal robustness of real-time systems w.r.t. classical {First-Fit/Best-Fit/Next-Fit}-Decreasing partitioning.

show abstract

“…Some models allow to take into account this kind of problem. For example, Bougueroua, in Bougueroua et al (2007), introduced the notion of allowance to achieve this aim.…”

Section: Introductionmentioning

confidence: 99%

Schedulability and sensitivity analysis of multiple criticality tasks with fixed-priorities

Dorin

Richard

et al. 2010

Real-Time Syst

View full text Add to dashboard Cite

Safety-critical real-time standards define several criticality levels for the tasks. In this paper we consider the real-time systems designed under the DO-178B safety assessment process (i.e., Software Considerations in Airborne Systems and Equipment Certification). Vestal introduced a new multiple criticality task model to efficiently take into account criticality levels in the schedulability analysis of such systems. Such a task model represents a potentially very significant advance in the modeling of safety-critical real-time softwares. Baruah and Vestal continue this investigation, with a new scheduling algorithm combining fixed and dynamic priority policies. Another major design issue is to allow a system developer to determine how sensitive is the schedulability analysis to changes in execution time of various software components.In this paper, we first prove that the well-known Audsley's algorithm is optimal for assigning priorities to tasks with multiple criticality levels. We then provide a proof on the optimality of Vestal's algorithm for optimizing the resource requirements to schedule tasks with multiple criticality levels. We then present a sensitivity analysis for multiple criticality tasks that is based on Bini et al. results on sporadic tasks.

show abstract

Dealing with execution-overruns to improve the temporal robustness of real-time systems scheduled FP and EDF

Abstract: International audienc

Cited by 13 publications

References 11 publications

Implications of Non-Uniform Deadline Scaling to Quality of Service Under Single Errors

Implications of Non-Uniform Deadline Scaling to Quality of Service Under Single Errors

Robust Partitioned Scheduling for Real-Time Multiprocessor Systems

Schedulability and sensitivity analysis of multiple criticality tasks with fixed-priorities

Contact Info

Product

Resources

About