Response Time Stochastic Analysis for Fixed-Priority Stable Real-Time Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles IEEE Transactions on Computers Year : 2022

Response Time Stochastic Analysis for Fixed-Priority Stable Real-Time Systems

Abstract

In this paper, we prove that a mean system utilization smaller than one is a necessary condition for the feasibility of real-time systems. Such systems are defined as stable. Stable systems have two distinct states: a transient state, followed by a steady-state where the same distribution of response times is repeated infinitely for each task. We prove that the Liu and Layland theorem holds for stable probabilistic real-time systems with implicit deadlines, we provide an analytical approximation of response times for each of those two states and a bound of the instant when a real-time system becomes steady.
Fichier principal
Vignette du fichier
rt_stochastic.pdf (1.76 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03797980 , version 1 (06-10-2022)
hal-03797980 , version 2 (07-10-2022)

Identifiers

Cite

Kevin Zagalo, Yasmina Abdeddaïm, Avner Bar-Hen, Liliana Cucu-Grosjean. Response Time Stochastic Analysis for Fixed-Priority Stable Real-Time Systems. IEEE Transactions on Computers, 2022, pp.1-12. ⟨10.1109/TC.2022.3211421⟩. ⟨hal-03797980v2⟩
196 View
116 Download

Altmetric

Share

Gmail Facebook X LinkedIn More