Publication
Provably good multiprocessor scheduling with resource sharing
| dc.contributor.author | Andersson, Björn | |
| dc.contributor.author | Easwaran, Arvind | |
| dc.date.accessioned | 2014-02-12T11:10:08Z | |
| dc.date.available | 2014-02-12T11:10:08Z | |
| dc.date.issued | 2010 | |
| dc.description.abstract | We present a 12(1 + 3R/(4m)) competitive algorithm for scheduling implicit-deadline sporadic tasks on a platform comprising m processors, where a task may request one of R shared resources. | por |
| dc.identifier.doi | 10.1007/s11241-010-9105-6 | pt_PT |
| dc.identifier.issn | 0922-6443 | |
| dc.identifier.issn | 1573-1383 | |
| dc.identifier.uri | http://hdl.handle.net/10400.22/3850 | |
| dc.language.iso | eng | por |
| dc.peerreviewed | yes | por |
| dc.publisher | Springer | por |
| dc.relation.ispartofseries | Real-Time Systems; Vol. 46, Issue 2 | |
| dc.relation.publisherversion | http://link.springer.com/article/10.1007%2Fs11241-010-9105-6 | por |
| dc.subject | Multiprocessor scheduling with resource sharing | por |
| dc.subject | Competitive ratio for multiprocessor resource sharing | por |
| dc.title | Provably good multiprocessor scheduling with resource sharing | por |
| dc.type | journal article | |
| dspace.entity.type | Publication | |
| oaire.citation.endPage | 159 | por |
| oaire.citation.issue | Issue 2 | por |
| oaire.citation.startPage | 153 | por |
| oaire.citation.title | Real-Time Systems | por |
| oaire.citation.volume | Vol. 46 | por |
| rcaap.rights | openAccess | por |
| rcaap.type | article | por |