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

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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01426632
Contributor : Sophie Quinton <>
Submitted on : Thursday, January 5, 2017 - 2:35:42 PM
Last modification on : Thursday, October 11, 2018 - 8:48:04 AM
Long-term archiving on : Thursday, April 6, 2017 - 1:49:11 PM

File

2017-DATE.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

  • HAL Id : hal-01426632, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

253

Files downloads

261