Publication
Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound
| dc.contributor.author | Bletsas, Konstantinos | |
| dc.contributor.author | Andersson, Björn | |
| dc.date.accessioned | 2014-02-06T12:54:08Z | |
| dc.date.available | 2014-02-06T12:54:08Z | |
| dc.date.issued | 2011 | |
| dc.description.abstract | Known algorithms capable of scheduling implicit-deadline sporadic tasks over identical processors at up to 100% utilisation invariably involve numerous preemptions and migrations. To the challenge of devising a scheduling scheme with as few preemptions and migrations as possible, for a given guaranteed utilisation bound, we respond with the algorithm NPS-F. It is configurable with a parameter, trading off guaranteed schedulable utilisation (up to 100%) vs preemptions. For any possible configuration, NPS-F introduces fewer preemptions than any other known algorithm matching its utilisation bound. A clustered variant of the algorithm, for systems made of multicore chips, eliminates (costly) off-chip task migrations, by dividing processors into disjoint clusters, formed by cores on the same chip (with the cluster size being a parameter). Clusters are independently scheduled (each, using non-clustered NPS-F). The utilisation bound is only moderately affected. We also formulate an important extension (applicable to both clustered and non-clustered NPS-F) which optimises the supply of processing time to executing tasks and makes it more granular. This reduces processing capacity requirements for schedulability without increasing preemptions. | por |
| dc.identifier.doi | 10.1007/s11241-011-9114-0 | pt_PT |
| dc.identifier.issn | 0922-6443 | |
| dc.identifier.issn | 1573-1383 | |
| dc.identifier.uri | http://hdl.handle.net/10400.22/3729 | |
| dc.language.iso | eng | por |
| dc.peerreviewed | yes | por |
| dc.publisher | Springer | por |
| dc.relation.ispartofseries | Real-Time Systems; Vol. 47, Issue 4 | |
| dc.relation.publisherversion | http://link.springer.com/article/10.1007/s11241-011-9114-0 | por |
| dc.subject | Multiprocessor scheduling | por |
| dc.subject | Utilisation bound | por |
| dc.subject | Multicore | por |
| dc.subject | Preemptions | por |
| dc.subject | Migrations | por |
| dc.title | Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound | por |
| dc.type | journal article | |
| dspace.entity.type | Publication | |
| oaire.citation.endPage | 355 | por |
| oaire.citation.startPage | 319 | por |
| oaire.citation.title | Real-Time Systems | por |
| oaire.citation.volume | 47 | por |
| rcaap.rights | closedAccess | por |
| rcaap.type | article | por |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- ART_KonstantinosBlestas_2011_CISTER.pdf
- Size:
- 1.89 MB
- 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: