Bounding deadline misses in weakly-hard real-time systems with task dependencies

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...

Full description

Saved in:
Bibliographic Details
Published inDesign, Automation & Test in Europe Conference & Exhibition (DATE), 2017 pp. 584 - 589
Main Authors Hammadeh, Zain A. H., Ernst, Rolf, Quinton, Sophie, Henia, Rafik, Rioux, Laurent
Format Conference Proceeding
LanguageEnglish
Published EDAA 01.03.2017
Subjects
Analytical models
Computational modeling
Delays
Interference
Real-time systems
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:1558-1101
DOI:10.23919/DATE.2017.7927054