Bounding Deadline Misses in Weakly-Hard Real-Time Systems with Task Dependencies - Archive ouverte HAL Access content directly
Conference Papers Year :

Bounding Deadline Misses in Weakly-Hard Real-Time Systems with Task Dependencies

(1) , (1) , (2) , (3) , (3)
1
2
3

Abstract

Real-time systems with functional dependencies between tasks often require end-to-end (as opposed to task-level) guarantees. For many of these systems, it is even possible to accept the possibility of longer end-to-end delays if one can bound their frequency. Such systems are called weakly-hard. In this paper we provide end-to-end deadline miss models for systems with task chains using Typical Worst-Case Analysis (TWCA). This bounds the number of potential deadline misses in a given sequence of activations of a task chain. To achieve this we exploit task chain properties which arise from the priority assignment of tasks in static-priority preemptive systems. This work is motivated by and validated on a realistic case study inspired by industrial practice and derived synthetic test cases.
Fichier principal
Vignette du fichier
2017-DATE.pdf (273.16 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01426632 , version 1 (05-01-2017)

Licence

Attribution - CC BY 4.0

Identifiers

  • HAL Id : hal-01426632 , version 1

Cite

Zain A. H. Hammadeh, Rolf Ernst, Sophie Quinton, Rafik Henia, Laurent Rioux. Bounding Deadline Misses in Weakly-Hard Real-Time Systems with Task Dependencies. Design, Automation & Test in Europe Conference & Exhibition (DATE 2017), Mar 2017, Lausanne, Switzerland. ⟨hal-01426632⟩
163 View
259 Download

Share

Gmail Facebook Twitter LinkedIn More