In this chapter, we describe a stochastic analysis framework that does not introduce any worst-case orrestrictive assumptions into the analysis, and is applicable to general priority-driven real-time systems. Theproposed framework builds up on Stochastic Time Demand Analysis (STDA) in that the techniques used inthe framework to compute the response time distributions of tasks are largely borrowed from the STDA.However, unlike the STDA, which focuses on particular execution scenarios starting at a critical instant,the proposed framework considers all possible execution scenarios in order to obtain the exact response time distributions of the tasks. Moreover, while the STDA addresses only fixed-priority systems such as RateMonotonic and Deadline Monotonic, our framework extends to dynamic -priority systems such asEarliest Deadline First.
|Titolo:||An Exact Stochastic Analysis of Priority-Driven Periodic Real-Time Systems and Its Approximations|
|Data di pubblicazione:||2007|
|Appare nelle tipologie:||2.1 Contributo in volume (Capitolo o Saggio)|