Weakly-Hard Real-Time Guarantees for Weighted Round-Robin Scheduling of Real-Time Messages

Communication resources often exist in distributed real-time systems, therefore, providing guarantees on a predefined end-to-end deadline requires a timing analysis of the communication resource. Worst-case response time analysis techniques for guaranteeing the system's schedulability are not e...

Full description

Saved in:
Bibliographic Details
Published in2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA) Vol. 1; pp. 384 - 391
Main Authors Hammadeh, Zain A. H., Ernst, Rolf
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2018
Subjects
Analytical models
Computational modeling
Microsoft Windows
Processor scheduling
Real-time systems
Task analysis
Time factors
Online AccessGet full text

Cover

More Information
Summary:Communication resources often exist in distributed real-time systems, therefore, providing guarantees on a predefined end-to-end deadline requires a timing analysis of the communication resource. Worst-case response time analysis techniques for guaranteeing the system's schedulability are not expressive enough for weakly-hard real-time systems. In weakly-hard real-time systems, the timing analysis ought to ensure that the distribution of the system deadline misses/mets is precisely bounded. In this paper, we compute weakly-hard real-time guarantees in the form of a deadline miss model using Typical Worst-Case Analysis for real-time messages with weighted round-robin scheduling. We evaluate the proposed analysis's scalability and the tightness of the computed deadline miss models. We illustrate also the applicability of our analysis in an industrial case study.
ISSN:1946-0759
DOI:10.1109/ETFA.2018.8502621