Verifying Weakly-Hard Real-Time Properties of Traffic Streams in Switched Networks

Abstract : In this paper, we introduce the first verification method which is able to provide weakly-hard real-time guarantees for tasks and task chains in systems with multiple resources under partitioned scheduling with fixed priorities. Existing weakly-hard real-time verification techniques are restricted today to systems with a single resource. A weakly-hard real-time guarantee specifies an upper bound on the maximum number m of deadline misses of a task in a sequence of k consecutive executions. Such a guarantee is useful if a task can experience a bounded number of deadline misses without impacting the system mission. We present our verification method in the context of switched networks with traffic streams between nodes, and demonstrate its practical applicability in an automotive case study.
Type de document :
Communication dans un congrès
ECRTS 2018 - 30th Euromicro Conference on Real-Time Systems, Jul 2018, Barcelona, Spain. pp.1-22, 〈10.4230/LIPIcs.ECRTS.2018.15〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01903759
Contributeur : Sophie Quinton <>
Soumis le : mercredi 24 octobre 2018 - 15:58:05
Dernière modification le : vendredi 26 octobre 2018 - 08:39:09
Document(s) archivé(s) le : vendredi 25 janvier 2019 - 14:28:06

Fichier

p15-ahrendts.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Leonie Ahrendts, Sophie Quinton, Thomas Boroske, Rolf Ernst. Verifying Weakly-Hard Real-Time Properties of Traffic Streams in Switched Networks. ECRTS 2018 - 30th Euromicro Conference on Real-Time Systems, Jul 2018, Barcelona, Spain. pp.1-22, 〈10.4230/LIPIcs.ECRTS.2018.15〉. 〈hal-01903759〉

Partager

Métriques

Consultations de la notice

72

Téléchargements de fichiers

19