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

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

http://hdl.handle.net/10400.22/7066

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
COM_CISTER_2015.pdf		270.24 KB	Adobe PDF	Download

Send Feedback

Authors

Souto, Pedro

Baltarejo Sousa, Paulo

Davis, Robert

Bletsas, Konstantinos

Tovar, Eduardo

Abstract(s)

Schedulability analyses, while valuable in theo-retical research, cannot be used in practice to reason aboutthe timing behaviour of a real-time system without includingthe overheads induced by the implementation of the schedul-ing algorithm. In this paper, we provide an overhead-awareschedulability analysis based on demand bound functions fortwo hard real-time semi-partitioned algorithms, EDF-WM andC=D. This analysis is based on a novel implementation thatrelies on the use of a global clock to reduce the overheadsincurred due to the release jitter of migrating subtasks. Theanalysis is used to guide the respective off-line task assignmentand splitting procedures. Finally, results of an evaluation areprovided highlighting how the different algorithms performwith and without a consideration of overheads.