In soft real-time systems, applications can tolerate rare deadline misses. Therefore, probabilistic arguments and analyses are applicable in the timing analyses for this class of systems, as demonstrated in many existing researches. Convolution-based analyses allow to derive tight deadline-miss probabilities, but suffer from a high time complexity. Among the analytical approaches, which result in a significantly faster runtime than the convolution-based approaches, the Chernoff bounds provide the tightest results. In this paper, we show that calculating the deadline-miss probability using Chernoff bounds can be solved by considering an equivalent convex optimization problem. This allows us to, on the one hand, decrease the runtime of the Chernoff bounds while, on the other hand, ensure a tighter approximation since a larger variable space can be searched more efficiently, i.e., by using binary search techniques over a larger area instead of a sequential search over a smaller area. We evaluate this approach considering synthesized task sets. Our approach is shown to be computationally efficient for large task systems, whilst experimentally suggesting reasonable approximation quality compared to an exact analysis.
|Title of host publication||Proceedings of the 2019 Design, Automation and Test in Europe Conference and Exhibition, DATE 2019|
|Publication status||Published - 2019|
|Event||Design, Automation & Test in Europe Conference & Exhibition, DATE 2019 - Florence, Italy|
Duration: 25 Mar 2019 → 29 Mar 2019
|Conference||Design, Automation & Test in Europe Conference & Exhibition, DATE 2019|
|Abbreviated title||DATE 2019|
|Period||25/03/19 → 29/03/19|