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
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.
| Main Author: | |
|---|---|
| Format: | report |
| Language: | eng |
| Published: |
2014
|
| Online Access: | http://hdl.handle.net/10400.22/3912 |
| Country: | Portugal |
| Oai: | oai:recipp.ipp.pt:10400.22/3912 |