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

• Type: Article in International Conference Proceedings Book
• Date: 2015

Authors

Pedro Souto (Author) FEUP; Paulo Sousa (Author) Other; Rob Davis (Author) Other; Konstantinos Bletsas (Author) Other; Eduardo Tovar (Author) Other

Conference proceedings International

Title: 2015 IEEE 21ST INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS

Pages: 110-121

21st IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)

Hong Kong Baptist Univ, Dept Comp Sci, Hong Kong, PEOPLES R CHINA, AUG 19-21, 2015

Indexing

ISI Web of Knowledge - 4 Citations

Scopus - 5 Citations

INSPEC

COMPENDEX

Scientific classification

CORDIS: Physical sciences > Computer science > Computer systems

FOS: Engineering and technology > Electrical engineering, Electronic engineering, Information engineering

Other information

Authenticus ID: P-00G-SY1

DOI: 10.1109/rtcsa.2015.13

Abstract (EN): 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, EDFWM- 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.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 12