The utilization bound of uniprocessor preemptive slack-monotonic scheduling is 50%
| Data(s) |
18/02/2014
18/02/2014
2008
|
|---|---|
| Resumo |
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%. |
| Identificador |
DOI: 10.1145/1363686.1363760 978-1-59593-753-7 |
| Idioma(s) |
eng |
| Publicador |
ACM |
| Relação |
SAC '08; http://dl.acm.org/citation.cfm?id=1363760 |
| Direitos |
closedAccess |
| Palavras-Chave | #Real-time #Embedded systems #Algorithms #Performance |
| Tipo |
article |
