A carregar...
Publicação
The utilization bound of uniprocessor preemptive slack-monotonic scheduling is 50%
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 81.86 KB | Adobe PDF |
Autores
Orientador(es)
Resumo(s)
Consider the problem of scheduling a set of sporadically arriving implicit-deadline tasks to meet deadlines on a uniprocessor. Static-priority scheduling is considered using the slack-monotonic priority-assignment scheme. We prove that its utilization bound is 50%.
Descrição
Palavras-chave
Real-time Embedded systems Algorithms Performance
Contexto Educativo
Citação
Editora
ACM