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.
Type de document :
Communication dans un congrès
Design, Automation & Test in Europe Conference & Exhibition (DATE 2017), Mar 2017, Lausanne, Switzerland. <https://www.date-conference.com/>
Liste complète des métadonnées

https://hal.inria.fr/hal-01426632
Contributeur : Sophie Quinton <>
Soumis le : jeudi 5 janvier 2017 - 14:35:42
Dernière modification le : mardi 20 juin 2017 - 17:08:09
Document(s) archivé(s) le : jeudi 6 avril 2017 - 13:49:11

Fichier

2017-DATE.pdf
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

  • 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. <https://www.date-conference.com/>. <hal-01426632>

Partager

Métriques

Consultations de
la notice

129

Téléchargements du document

87