Verifying Weakly-Hard Real-Time Properties of Traffic Streams in Switched Networks - Archive ouverte HAL Access content directly
Conference Papers Year :

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

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

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.
Fichier principal
Vignette du fichier
p15-ahrendts.pdf (1.16 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01903759 , version 1 (24-10-2018)

Identifiers

Cite

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⟩
129 View
79 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More