Conjecture about global fixed-priority preemptive multiprocessor scheduling of implicit-deadline sporadic tasks: the utilization bound of SM-US(sqrt(2)-1) is sqrt(2)-1
| Data(s) |
14/02/2014
14/02/2014
2010
|
|---|---|
| Resumo |
Consider global fixed-priority preemptive multiprocessor scheduling of implicit-deadline sporadic tasks. I conjecture that the utilization bound of SM-US(√2−1) is √2-1. |
| Identificador | |
| Idioma(s) |
eng |
| Publicador |
IPP Hurray! Research Group |
| Relação |
http://www.cister.isep.ipp.pt/docs/ |
| Direitos |
openAccess |
| Tipo |
report |
