A framework for the response time analysis of fixed-priority tasks with stochastic inter-arrival times
Real-time scheduling usually considers worst-case values for the parameters of task (or message stream) sets, in order to provide safe schedulability tests for hard real-time systems. However, worst-case conditions introduce a level of pessimism that is often inadequate for a certain class of (soft)...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | article |
| Language: | eng |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10400.22/4013 |
| Country: | Portugal |
| Oai: | oai:recipp.ipp.pt:10400.22/4013 |
| Summary: | Real-time scheduling usually considers worst-case values for the parameters of task (or message stream) sets, in order to provide safe schedulability tests for hard real-time systems. However, worst-case conditions introduce a level of pessimism that is often inadequate for a certain class of (soft) real-time systems. In this paper we provide an approach for computing the stochastic response time of tasks where tasks have inter-arrival times described by discrete probabilistic distribution functions, instead of minimum inter-arrival (MIT) values. |
|---|