Publication
Sporadic multiprocessor scheduling with few preemptions
| dc.contributor.author | Andersson, Björn | |
| dc.contributor.author | Bletsas, Konstantinos | |
| dc.date.accessioned | 2014-02-18T12:33:27Z | |
| dc.date.available | 2014-02-18T12:33:27Z | |
| dc.date.issued | 2008 | |
| dc.description.abstract | Consider the problem of scheduling n sporadic tasks so as to meet deadlines on m identical processors. A task is characterised by its minimum interarrival time and its worst-case execution time. Tasks are preemptible and may migrate between processors. We propose an algorithm with limited migration, configurable for a utilisation bound of 88% with few preemptions (and arbitrarily close to 100% with more preemptions). | por |
| dc.identifier | DOI 10.1109/ECRTS.2008.9 | |
| dc.identifier.isbn | 978-0-7695-3298-1 | |
| dc.identifier.issn | 1068-3070 | |
| dc.identifier.uri | http://hdl.handle.net/10400.22/3936 | |
| dc.language.iso | eng | por |
| dc.peerreviewed | yes | por |
| dc.publisher | IEEE | por |
| dc.relation.ispartofseries | Real-Time Systems | |
| dc.relation.publisherversion | http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=4573120 | por |
| dc.title | Sporadic multiprocessor scheduling with few preemptions | por |
| dc.type | conference object | |
| dspace.entity.type | Publication | |
| oaire.citation.conferencePlace | Prague | |
| oaire.citation.endPage | 252 | por |
| oaire.citation.startPage | 243 | por |
| oaire.citation.title | Euromicro Conference on Real-Time Systems | |
| rcaap.rights | closedAccess | por |
| rcaap.type | conferenceObject | por |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- COM_BjornAndersson_2008_CISTER.pdf
- Size:
- 334.76 KB
- Format:
- Adobe Portable Document Format
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: