Verifying Weakly-Hard Real-Time Properties of Traffic Streams in Switched Networks
| Autor: | Ahrendts, Leonie, Quinton, Sophie, Boroske, Thomas, Ernst, Rolf |
|---|---|
| Přispěvatelé: | Institute of Computer and Network Engineering [Braunschweig] (IDA), Technische Universität Braunschweig = Technical University of Braunschweig [Braunschweig], Sound Programming of Adaptive Dependable Embedded Systems (SPADES), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]) |
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: |
0209 industrial biotechnology
000 Computer science knowledge general works 02 engineering and technology Article ddc:0 020901 industrial engineering & automation weakly-hard real-time systems and networks -- timing analysis -- embedded and cyber-physical systems Computer Science ddc:00 0202 electrical engineering electronic engineering information engineering Veröffentlichung der TU Braunschweig 020201 artificial intelligence & image processing [INFO.INFO-ES]Computer Science [cs]/Embedded Systems ddc:004 |
| Zdroj: | ECRTS 2018-30th Euromicro Conference on Real-Time Systems ECRTS 2018-30th Euromicro Conference on Real-Time Systems, Jul 2018, Barcelona, Spain. pp.1-22, ⟨10.4230/LIPIcs.ECRTS.2018.15⟩ 30th Euromicro Conference on Real-Time Systems (ECRTS 2018). Editor: Sebastian Altmeyer; Article No. 15; pp. 15:1–15:22 |
| DOI: | 10.4230/LIPIcs.ECRTS.2018.15⟩ |
| Popis: | International audience; 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|