The utilization bound of uniprocessor preemptive slack-monotonic scheduling is 50%
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%.
| Autor principal: | |
|---|---|
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2014
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10400.22/3963 |
| País: | Portugal |
| Oai: | oai:recipp.ipp.pt:10400.22/3963 |