Publication
The utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50%
| dc.contributor.author | Andersson, Björn | |
| dc.date.accessioned | 2014-02-21T10:46:08Z | |
| dc.date.available | 2014-02-21T10:46:08Z | |
| dc.date.issued | 2006 | |
| dc.description.abstract | This paper studies static-priority preemptive scheduling on a multiprocessor using partitioned scheduling. We propose a new scheduling algorithm and prove that if the proposed algorithm is used and if less than 50% of the capacity is requested then all deadlines are met. It is known that for every static-priority multiprocessor scheduling algorithm, there is a task set that misses a deadline although the requested capacity is arbitrary close to 50%. | por |
| dc.identifier.doi | 10.3233/JEC-2009-0107 | pt_PT |
| dc.identifier.issn | 1740-4460 | |
| dc.identifier.issn | 1875-9025 | |
| dc.identifier.uri | http://hdl.handle.net/10400.22/4014 | |
| dc.language.iso | eng | por |
| dc.peerreviewed | yes | por |
| dc.publisher | IOS Press | por |
| dc.relation.ispartofseries | Journal of Embedded Computing; Vol. 4, Issue 2 | |
| dc.relation.publisherversion | http://iospress.metapress.com/content/36l623l14u672183/ | por |
| dc.subject | Real-time scheduling | por |
| dc.subject | Partitioning | por |
| dc.subject | Bin-packing algorithms | por |
| dc.subject | Static-priority scheduling | por |
| dc.subject | Preemptive scheduling | por |
| dc.subject | Multiprocessors | por |
| dc.title | The utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50% | por |
| dc.type | journal article | |
| dspace.entity.type | Publication | |
| oaire.citation.endPage | 54 | por |
| oaire.citation.issue | Issue 2 | por |
| oaire.citation.startPage | 47 | por |
| oaire.citation.title | Journal of Embedded Computing | por |
| oaire.citation.volume | Vol. 4 | por |
| rcaap.rights | openAccess | por |
| rcaap.type | article | por |