Publication
The utilization bound of uniprocessor preemptive slack-monotonic scheduling is 50%
| dc.contributor.author | Andersson, Björn | |
| dc.date.accessioned | 2014-02-18T15:21:36Z | |
| dc.date.available | 2014-02-18T15:21:36Z | |
| dc.date.issued | 2008 | |
| dc.description.abstract | Consider the problem of scheduling a set of sporadically arriving implicit-deadline tasks to meet deadlines on a uniprocessor. Static-priority scheduling is considered using the slack-monotonic priority-assignment scheme. We prove that its utilization bound is 50%. | por |
| dc.identifier.doi | 10.1145/1363686.1363760 | pt_PT |
| dc.identifier.isbn | 978-1-59593-753-7 | |
| dc.identifier.uri | http://hdl.handle.net/10400.22/3963 | |
| dc.language.iso | eng | por |
| dc.peerreviewed | yes | por |
| dc.publisher | ACM | por |
| dc.relation.ispartofseries | SAC '08; | |
| dc.relation.publisherversion | http://dl.acm.org/citation.cfm?id=1363760 | por |
| dc.subject | Real-time | por |
| dc.subject | Embedded systems | por |
| dc.subject | Algorithms | por |
| dc.subject | Performance | por |
| dc.title | The utilization bound of uniprocessor preemptive slack-monotonic scheduling is 50% | por |
| dc.type | journal article | |
| dspace.entity.type | Publication | |
| oaire.citation.conferencePlace | Fortaleza, Ceara, Brazil | por |
| oaire.citation.endPage | 283 | por |
| oaire.citation.startPage | 281 | por |
| oaire.citation.title | SAC '08 Proceedings of the 2008 ACM symposium on Applied computing | por |
| rcaap.rights | closedAccess | por |
| rcaap.type | article | por |