| dc.contributor.author | Raravi, Gurulingesh | |
| dc.contributor.author | Nélis, Vincent | |
| dc.date.accessioned | 2014-02-04T16:07:01Z | |
| dc.date.available | 2014-02-04T16:07:01Z | |
| dc.date.issued | 2012 | |
| dc.description.abstract | Consider the problem of determining a task-toprocessor assignment for a given collection of implicit-deadline sporadic tasks upon a multiprocessor platform in which there are two distinct kinds of processors. We propose a polynomialtime approximation scheme (PTAS) for this problem. It offers the following guarantee: for a given task set and a given platform, if there exists a feasible task-to-processor assignment, then given an input parameter, ϵ, our PTAS succeeds, in polynomial time, in finding such a feasible task-to-processor assignment on a platform in which each processor is 1+3ϵ times faster. In the simulations, our PTAS outperforms the state-of-the-art PTAS [1] and also for the vast majority of task sets, it requires significantly smaller processor speedup than (its upper bound of) 1+3ϵ for successfully determining a feasible task-to-processor assignment. | por |
| dc.identifier.uri | http://hdl.handle.net/10400.22/3700 | |
| dc.language.iso | eng | por |
| dc.peerreviewed | no | por |
| dc.publisher | IPP Hurray! Research Group | por |
| dc.relation.publisherversion | http://www.cister.isep.ipp.pt/docs/ | por |
| dc.title | A PTAS for assigning sporadic tasks on two-type heterogeneous multiprocessors | por |
| dc.type | report | |
| dspace.entity.type | Publication | |
| rcaap.rights | openAccess | por |
| rcaap.type | report | por |
