Formal analysis of sporadic bursts in real-time systems

Authors:
Sophie Quinton;Mircea Negrean;Rolf Ernst
Affiliations:
Institute of Computer and Network Engineering, Braunschweig, Germany;Institute of Computer and Network Engineering, Braunschweig, Germany;Institute of Computer and Network Engineering, Braunschweig, Germany
Venue:
Proceedings of the Conference on Design, Automation and Test in Europe
Year:
2013

Citing 7
Cited 0

An extendible approach for analyzing fixed priority hard real-time tasks

Real-Time Systems
Weakly Hard Real-Time Systems

IEEE Transactions on Computers
A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines

IEEE Transactions on Computers
Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised

Real-Time Systems
Stochastic analysis of real-time systems under preemptive priority-driven scheduling

Real-Time Systems
Scenario extraction for a refined timing-analysis of automotive network topologies

Proceedings of the Conference on Design, Automation and Test in Europe
Formal analysis of sporadic overload in real-time systems

DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a new method for the analysis of response times in uni-processor real-time systems where task activation patterns may contain sporadic bursts. We use a burst model to calculate how often response times may exceed the worst-case response time bound obtained while ignoring bursts. This work is of particular interest to deal with dual-cyclic frames in the analysis of CAN buses. Our approach can handle arbitrary activation patterns and the static priority preemptive as well as non-preemptive scheduling policies. Experiments show the applicability and the benefits of the proposed method.