Notional processors: an approach for multiprocessor scheduling

Publication

dc.contributor.author	Bletsas, Konstantinos
dc.contributor.author	Andersson, Björn
dc.date.accessioned	2014-02-12T12:13:35Z
dc.date.available	2014-02-12T12:13:35Z
dc.date.issued	2009
dc.description.abstract	Consider the problem of designing an algorithm with a high utilisation bound for scheduling sporadic tasks with implicit deadlines on identical processors. A task is characterised by its minimum interarrival time and its execution time. Task preemption and migration is permitted. Still, low preemption and migration counts are desirable. We formulate an algorithm with a utilisation bound no less than 66.¯6%, characterised by worst-case preemption counts comparing favorably against the state-of-the-art.	por
dc.identifier.doi	10.1109/RTAS.2009.25	pt_PT
dc.identifier.isbn	978-0-7695-3636-1
dc.identifier.issn	1545-3421
dc.identifier.uri	http://hdl.handle.net/10400.22/3859
dc.language.iso	eng	por
dc.peerreviewed	yes	por
dc.publisher	IEEE	por
dc.relation.ispartofseries	Real-Time and Embedded Technology and Applications Symposium;
dc.relation.publisherversion	http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=4840562	por
dc.title	Notional processors: an approach for multiprocessor scheduling	por
dc.type	journal article
dspace.entity.type	Publication
oaire.citation.endPage	12	por
oaire.citation.startPage	3	por
oaire.citation.title	RTAS 2009. 15th IEEE Real-Time and Embedded Technology and Applications Symposium	por
rcaap.rights	openAccess	por
rcaap.type	article	por

Files

Now showing 1 - 1 of 1

Now showing 1 - 1 of 1