A Response-Time Analysis for Non-Preemptive Job Sets under Global Scheduling
Ref: CISTER-TR-180503 Publication Date: 3 to 6, Jul, 2018
A Response-Time Analysis for Non-Preemptive Job Sets under Global Scheduling
Ref: CISTER-TR-180503 Publication Date: 3 to 6, Jul, 2018Abstract:
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 reduce s 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 up on an identical multicore platform. The analysis yields a lower bound on th e b est-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.
Events:
Document:
30th Euromicro Conference on Real-Time Systems (ECRTS 2018), pp 9:1-9:23.
Barcelona, Spain.
DOI:10.4230/LIPIcs.ECRTS.2018.9.
ISBN: 978-3-95977-075-0.
ISSN: 1868-8969.
Notes: Volume 106
Record Date: 3, May, 2018