Extending typical worst-case analysis using response-time dependencies to bound deadline misses - Archive ouverte HAL Access content directly
Conference Papers Year :

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

(1) , (2) , (1)
1
2

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.
Not file

Dates and versions

hal-01097621 , version 1 (20-12-2014)

Identifiers

Cite

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⟩
116 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More