Publication
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
| dc.contributor.author | Andersson, Björn | |
| dc.date.accessioned | 2014-02-14T15:38:59Z | |
| dc.date.available | 2014-02-14T15:38:59Z | |
| dc.date.issued | 2010 | |
| dc.description.abstract | 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. | por |
| dc.identifier.uri | http://hdl.handle.net/10400.22/3912 | |
| dc.language.iso | eng | por |
| dc.peerreviewed | no | por |
| dc.publisher | IPP Hurray! Research Group | por |
| dc.relation.publisherversion | http://www.cister.isep.ipp.pt/docs/ | por |
| dc.title | 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 | por |
| dc.type | report | |
| dspace.entity.type | Publication | |
| rcaap.rights | openAccess | por |
| rcaap.type | report | por |