| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 189 KB | Adobe PDF |
Autores
Orientador(es)
Resumo(s)
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.
Descrição
Palavras-chave
Real-time systems Schedulability analysis Stochastic analysis Fixed-priority scheduling
Contexto Educativo
Citação
Editora
ACM
