Extending typical worst-case analysis using response-time dependencies to bound deadline misses

Weakly-hard time constraints have been proposed for applications where occasional deadline misses are permitted. Recently, a new approach called Typical Worst-Case Analysis (TWCA) has been introduced which exploits similar constraints to bound response times of systems with sporadic overload. In this paper, we extend that approach for static priority preemptive and non-preemptive scheduling to determine the maximum number of deadline misses for a given deadline. The approach is based on an optimization problem which trades off higher priority interference versus miss count. We formally derive a lattice structure for the possible combinations that lays the ground for an integer linear programming (ILP) formulation. The ILP solution is evaluated showing effectiveness of the approach and far better results than previous TWCA.

[1]  Lothar Thiele,et al.  A general framework for analysing system properties in platform-based embedded system designs , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

[2]  Jukka Mäki-Turja,et al.  Extending schedulability analysis of Controller Area Network (CAN) for mixed (periodic/sporadic) messages , 2011, ETFA2011.

[3]  John P. Lehoczky,et al.  Fixed priority scheduling of periodic task sets with arbitrary deadlines , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[4]  Alan Burns,et al.  Weakly Hard Real-Time Systems , 2001, IEEE Trans. Computers.

[5]  Lothar Thiele,et al.  Quantifying the Effect of Rare Timing Events with Settling-Time and Overshoot , 2012, 2012 IEEE 33rd Real-Time Systems Symposium.

[6]  Liliana Cucu-Grosjean,et al.  PROARTIS: Probabilistically Analyzable Real-Time Systems , 2013, TECS.

[7]  Joaquín Entrialgo,et al.  Stochastic analysis of real-time systems under preemptive priority-driven scheduling , 2008, Real-Time Systems.

[8]  Rolf Ernst,et al.  Probabilistic response time bound for CAN messages with arbitrary deadlines , 2012, 2012 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[9]  Alan Burns,et al.  An extendible approach for analyzing fixed priority hard real-time tasks , 1994, Real-Time Systems.

[10]  Rolf Ernst,et al.  Formal analysis of sporadic overload in real-time systems , 2012, 2012 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[11]  Rolf Ernst,et al.  Formal analysis of sporadic bursts in real-time systems , 2013, 2013 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[12]  Rolf Ernst,et al.  System level performance analysis - the SymTA/S approach , 2005 .

[13]  R. Ernst,et al.  Compositional Performance Analysis in Python with pyCPA , 2012 .

[14]  Alan Burns,et al.  Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised , 2007, Real-Time Systems.