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.

MS-GD-P: Priority-Based Service Deployment for Cloud-Edge-End Scenarios

“…Setting service priorities ensures that critical and urgent services receive sufficient resources and are treated with higher precedence to meet their needs and requirements. References [6] and [7] utilize the Deadline Monotonic (DM) scheduling algorithm to determine task priorities and the priority for accessing shared resources. References [8] and [9] introduce per-flow priority, associating each priority with an individual flow.…”