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

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01097621
Contributor : Sophie Quinton <>
Submitted on : Saturday, December 20, 2014 - 11:03:04 AM
Last modification on : Thursday, October 11, 2018 - 8:48:04 AM

Identifiers

Collections

Citation

Zain A. H. Hammadeh, Sophie Quinton, Rolf Ernst. Extending typical worst-case analysis using response-time dependencies to bound deadline misses. 14th International Conference on Embedded Software 2014 (EMSOFT), Oct 2014, New Delhi, India. ⟨10.1145/2656045.2656059⟩. ⟨hal-01097621⟩

Share

Metrics

Record views

217