Publication
A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversary
| dc.contributor.author | Raravi, Gurulingesh | |
| dc.contributor.author | Andersson, Björn | |
| dc.contributor.author | Bletsas, Konstantinos | |
| dc.date.accessioned | 2014-02-06T14:57:21Z | |
| dc.date.available | 2014-02-06T14:57:21Z | |
| 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 heterogeneous multiprocessor platform. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multiprocessor platform and (re-)prove its performance guarantee but for a stronger adversary.We conjecture that if a task set can be scheduled to meet deadlines on a heterogeneous multiprocessor platform by an optimal task assignment scheme that allows task migrations then LP-EE meets deadlines as well with no migrations if given processors twice as fast. We illustrate this with an example. | por |
| dc.identifier.uri | http://hdl.handle.net/10400.22/3742 | |
| 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 | por |
| dc.subject | Task migrations | por |
| dc.subject | Real-time scheduling | por |
| dc.title | A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversary | por |
| dc.type | report | |
| dspace.entity.type | Publication | |
| oaire.citation.endPage | 6 | por |
| oaire.citation.startPage | 1 | por |
| rcaap.rights | openAccess | por |
| rcaap.type | report | por |