Global static-priority preemptive multiprocessor scheduling with utilization bound 38%

Publication

dc.contributor.author	Andersson, Björn
dc.date.accessioned	2014-02-18T12:36:09Z
dc.date.available	2014-02-18T12:36:09Z
dc.date.issued	2008
dc.description.abstract	Consider the problem of scheduling real-time tasks on a multiprocessor with the goal of meeting deadlines. Tasks arrive sporadically and have implicit deadlines, that is, the deadline of a task is equal to its minimum inter-arrival time. Consider this problem to be solved with global static-priority scheduling. We present a priority-assignment scheme with the property that if at most 38% of the processing capacity is requested then all deadlines are met.	por
dc.identifier.doi	10.1007/978-3-540-92221-6_7	pt_PT
dc.identifier.isbn	978-3-540-92221-6
dc.identifier.issn	0302-9743
dc.identifier.uri	http://hdl.handle.net/10400.22/3938
dc.language.iso	eng	por
dc.peerreviewed	yes	por
dc.publisher	Springer	por
dc.relation.ispartofseries	Principles of Distributed Systems. Lecture Notes in Computer Science; Vol. 5401
dc.relation.publisherversion	http://link.springer.com/chapter/10.1007/978-3-540-92221-6_7	por
dc.title	Global static-priority preemptive multiprocessor scheduling with utilization bound 38%	por
dc.type	book part
dspace.entity.type	Publication
oaire.citation.conferencePlace	Luxor, Egypt	por
oaire.citation.endPage	88	por
oaire.citation.startPage	73	por
oaire.citation.title	12th International Conference, OPODIS 2008	por
oaire.citation.volume	5401	por
rcaap.rights	closedAccess	por
rcaap.type	bookPart	por

Files

Now showing 1 - 1 of 1

Now showing 1 - 1 of 1