Publicação
Provably good scheduling of sporadic tasks with resource sharing on a two-type heterogeneous multiprocessor platform
| dc.contributor.author | Raravi, Gurulingesh | |
| dc.contributor.author | Andersson, Björn | |
| dc.contributor.author | Bletsas, Konstantinos | |
| dc.date.accessioned | 2014-02-06T15:09:07Z | |
| dc.date.available | 2014-02-06T15:09:07Z | |
| dc.date.issued | 2011 | |
| dc.description.abstract | Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform where a task may request at most one of |R| shared resources. There are m1 processors of type-1 and m2 processors of type-2. Tasks may migrate only when requesting or releasing resources. We present a new algorithm, FF-3C-vpr, which offers a guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that only allows tasks to migrate when requesting or releasing a resource, then FF-3Cvpr also meets deadlines if given processors 4+6*ceil(|R|/min(m1,m2)) times as fast. As far as we know, it is the first result for resource sharing on heterogeneous platforms with provable performance. | por |
| dc.identifier.uri | http://hdl.handle.net/10400.22/3748 | |
| dc.language.iso | eng | por |
| dc.peerreviewed | no | por |
| dc.publisher | IPP-Hurray Group | por |
| dc.relation.publisherversion | http://www.cister.isep.ipp.pt/docs/ | por |
| dc.subject | Heterogeneous multiprocessor systems | por |
| dc.subject | Real-time scheduling | por |
| dc.subject | Resource sharing | por |
| dc.title | Provably good scheduling of sporadic tasks with resource sharing on a two-type heterogeneous multiprocessor platform | por |
| dc.type | report | |
| dspace.entity.type | Publication | |
| oaire.citation.endPage | 18 | por |
| oaire.citation.startPage | 1 | por |
| rcaap.rights | openAccess | por |
| rcaap.type | report | por |