Publicação
A Response-Time Analysis for Non-Preemptive Job Sets under Global Scheduling
| dc.contributor.author | Nasri, Mitra | |
| dc.contributor.author | Nelissen, Geoffrey | |
| dc.contributor.author | B. Brandenburg, Björn | |
| dc.date.accessioned | 2018-11-30T10:02:55Z | |
| dc.date.available | 2018-11-30T10:02:55Z | |
| dc.date.issued | 2018 | |
| dc.description.abstract | An effective way to increase the timing predictability of multicore platforms is to use non-preemptive scheduling. It reduces preemption and job migration overheads, avoids intra-core cache interference, and improves the accuracy of worst-case execution time (WCET) estimates. However, existing schedulability tests for global non-preemptive multiprocessor scheduling are pessimistic, especially when applied to periodic workloads. This paper reduces this pessimism by introducing a new type of sufficient schedulability analysis that is based on an exploration of the space of possible schedules using concise abstractions and state-pruning techniques. Specifically, we analyze the schedulability of non-preemptive job sets (with bounded release jitter and execution time variation) scheduled by a global job-level fixed-priority (JLFP) scheduling algorithm upon an identical multicore platform. The analysis yields a lower bound on the best-case response-time (BCRT) and an upper bound on the worst-case response time (WCRT) of the jobs. In an empirical evaluation with randomly generated workloads, we show that the method scales to 30 tasks, a hundred thousand jobs (per hyperperiod), and up to 9 cores. | pt_PT |
| dc.description.version | info:eu-repo/semantics/publishedVersion | pt_PT |
| dc.identifier.doi | 10.4230/LIPIcs.ECRTS.2018.9 | pt_PT |
| dc.identifier.issn | 1868-8969 | |
| dc.identifier.uri | http://hdl.handle.net/10400.22/12325 | |
| dc.language.iso | eng | pt_PT |
| dc.peerreviewed | yes | pt_PT |
| dc.publisher | Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik | pt_PT |
| dc.relation.publisherversion | http://drops.dagstuhl.de/opus/volltexte/2018/8994/ | pt_PT |
| dc.subject | Global multiprocessor scheduling | pt_PT |
| dc.subject | Schedulability analysis | pt_PT |
| dc.subject | Non-preemptive tasks | pt_PT |
| dc.subject | Worst-case response time | pt_PT |
| dc.subject | Best-case response time | pt_PT |
| dc.title | A Response-Time Analysis for Non-Preemptive Job Sets under Global Scheduling | pt_PT |
| dc.type | conference object | |
| dspace.entity.type | Publication | |
| oaire.citation.conferencePlace | Barcelona, Spain | pt_PT |
| oaire.citation.endPage | 9:23 | pt_PT |
| oaire.citation.startPage | 9:1 | pt_PT |
| oaire.citation.title | 2018 30th Euromicro Conference on Real-Time Systems (ECRTS) Proceedings | pt_PT |
| oaire.citation.volume | 106 | pt_PT |
| rcaap.rights | openAccess | pt_PT |
| rcaap.type | conferenceObject | pt_PT |
Ficheiros
Principais
1 - 1 de 1
A carregar...
- Nome:
- COM13_CISTER_2018_LIPIcs-ECRTS-2018-9.pdf
- Tamanho:
- 1.94 MB
- Formato:
- Adobe Portable Document Format