Publication
Assigning real-time tasks on heterogeneous multiprocessors with two types of processors
| dc.contributor.author | Andersson, Björn | |
| dc.contributor.author | Bletsas, Konstantinos | |
| dc.date.accessioned | 2014-02-12T11:51:35Z | |
| dc.date.available | 2014-02-12T11:51:35Z | |
| dc.date.issued | 2009 | |
| dc.description.abstract | Consider the problem of scheduling a set of implicitdeadline sporadic tasks on a heterogeneous multiprocessor so as to meet all deadlines. Tasks cannot migrate and the platform is restricted in that each processor is either of type-1 or type-2 (with each task characterized by a different speed of execution upon each type of processor). We present an algorithm for this problem with a timecomplexity of O(n·m), where n is the number of tasks and m is the number of processors. It offers the guarantee that if a task set can be scheduled by any non-migrative algorithm to meet deadlines then our algorithm meets deadlines as well if given processors twice as fast. Although this result is proven for only a restricted heterogeneous multiprocessor, we consider it significant for being the first realtime scheduling algorithm to use a low-complexity binpacking approach to schedule tasks on a heterogeneous multiprocessor with provably good performance. | por |
| dc.identifier.uri | http://hdl.handle.net/10400.22/3856 | |
| dc.language.iso | eng | por |
| dc.peerreviewed | yes | por |
| dc.publisher | IPP-Hurray Group | por |
| dc.relation.publisherversion | http://www.cister.isep.ipp.pt/docs/ | por |
| dc.title | Assigning real-time tasks on heterogeneous multiprocessors with two types of processors | por |
| dc.type | report | |
| dspace.entity.type | Publication | |
| oaire.citation.endPage | 12 | por |
| oaire.citation.startPage | 1 | por |
| rcaap.rights | openAccess | por |
| rcaap.type | report | por |