Publication
Multiprocessor scheduling with few preemptions
dc.contributor.author | Andersson, Björn | |
dc.contributor.author | Tovar, Eduardo | |
dc.date.accessioned | 2014-02-25T10:53:37Z | |
dc.date.available | 2014-02-25T10:53:37Z | |
dc.date.issued | 2006 | |
dc.description.abstract | Consider the problem of scheduling a set of periodically arriving tasks on a multiprocessor with the goal of meeting deadlines. Processors are identical and have the same speed. Tasks can be preempted and they can migrate between processors. We propose an algorithm with a utilization bound of 66% and with few preemptions. It can trade a higher utilization bound for more preemption and in doing so it has a utilization bound of 100%. | por |
dc.identifier.doi | 10.1109/RTCSA.2006.45 | pt_PT |
dc.identifier.isbn | 0-7695-2676-4 | |
dc.identifier.issn | 1533-2306 | |
dc.identifier.uri | http://hdl.handle.net/10400.22/4037 | |
dc.language.iso | eng | por |
dc.peerreviewed | yes | por |
dc.publisher | IEEE | por |
dc.relation.ispartofseries | Embedded and Real-Time Computing Systems and Applications; | |
dc.relation.publisherversion | http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1691331&tag=1 | por |
dc.title | Multiprocessor scheduling with few preemptions | por |
dc.type | conference object | |
dspace.entity.type | Publication | |
oaire.citation.conferencePlace | Sydney, Qld. | por |
oaire.citation.endPage | 334 | por |
oaire.citation.startPage | 322 | por |
oaire.citation.title | 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications | por |
person.familyName | Tovar | |
person.givenName | Eduardo | |
person.identifier.ciencia-id | 6017-8881-11E8 | |
person.identifier.orcid | 0000-0001-8979-3876 | |
person.identifier.scopus-author-id | 7006312557 | |
rcaap.rights | closedAccess | por |
rcaap.type | conferenceObject | por |
relation.isAuthorOfPublication | 80b63d8a-2e6d-484e-af3c-55849d0cb65e | |
relation.isAuthorOfPublication.latestForDiscovery | 80b63d8a-2e6d-484e-af3c-55849d0cb65e |