Overhead-aware schedulability evaluation of semi-partitioned real-time schedulers
Ref: CISTER-TR-150402 Publication Date: 19 to 21, Aug, 2015
Overhead-aware schedulability evaluation of semi-partitioned real-time schedulersRef: CISTER-TR-150402 Publication Date: 19 to 21, Aug, 2015
Schedulability analyses, while valuable in theo- retical research, cannot be used in practice to reason about the timing behaviour of a real-time system without including the overheads induced by the implementation of the schedul- ing algorithm. In this paper, we provide an overhead-aware schedulability analysis based on demand bound functions for two hard real-time semi-partitioned algorithms, EDF-WM and C=D. This analysis is based on a novel implementation that relies on the use of a global clock to reduce the overheads incurred due to the release jitter of migrating subtasks. The analysis is used to guide the respective off-line task assignment and splitting procedures. Finally, results of an evaluation are provided highlighting how the different algorithms perform with and without a consideration of overheads.
IEEE 21st International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2015).
Hong Kong, China.