Overhead-aware schedulability evaluation of semi-partitioned real-time schedulers

Pedro Souto, Paulo Baltarejo Sousa, Robert Ian Davis, Konstantinos Bletsas, Eduardo Tovar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Schedulability analyses, while valuable in theoretical
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 scheduling algorithm. In this paper, we provide an overhead-aware schedulability analysis based on demand bound functions for two hard real-time semi-partitioned scheduling algorithms, EDF-WM and C=D. This analysis is based on a novel implementation that uses 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.
Original languageEnglish
Title of host publicationProceedings, IEEE 21st International Conference on Embedded and Real-Time Computing Systems and Applications
PublisherIEEE
Pages110-121
ISBN (Print)978-1-4673-7855-0
DOIs
Publication statusPublished - Aug 2015
Event21st IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA) - , United Kingdom
Duration: 19 Aug 201521 Aug 2015

Publication series

NameEmbedded and Real-Time Computing Systems and Applications (RTCSA), IEEE International Conference on (Formerly Real-Time Computing Systems and Applications, International Workshop on)
PublisherIEEE

Conference

Conference21st IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)
Country/TerritoryUnited Kingdom
Period19/08/1521/08/15

Cite this