Refinement of worst-case execution time bounds by graph pruning

Abstract : As real-time systems increase in complexity to provide more and more functionality and perform more demanding computations, the problem of statically analyzing the Worst-Case Execution Time (WCET) bound of real-time programs is becoming more and more time-consuming and imprecise. The problem stems from the fact that with increasing program size, the number of potentially relevant program and hardware states that need to be considered during WCET analysis increases as well. However, only a relatively small portion of the program actually contributes to the final WCET bound. Large parts of the program are thus irrelevant and are analyzed in vain. In the best case this only leads to increased analysis time. Very often, however, the analysis of irrelevant program parts interferes with the analysis of those program parts that turn out to be relevant. We explore a novel technique based on graph pruning that promises to reduce the analysis overhead and, at the same time, increase the analysis’ precision. The basic idea is to eliminate those program parts from the analysis problem that are known to be irrelevant for the final WCET bound. This reduces the analysis overhead, since only a subset of the program and hardware states have to be tracked. Consequently, more aggressive analysis techniques may be applied, effectively reducing the overestimation of the WCET. As a side-effect, interference from irrelevant program parts is eliminated, e.g., on addresses of memory accesses, on loop bounds, or on the cache or processor state. First experiments using a commercial WCET analysis tool show that our approach is feasible in practice and leads to reductions of up to 12% when a standard IPET approach is used for the analysis.
Liste complète des métadonnées

https://hal-ensta.archives-ouvertes.fr/hal-01108029
Contributeur : Florian Brandner <>
Soumis le : jeudi 22 janvier 2015 - 09:47:26
Dernière modification le : jeudi 16 novembre 2017 - 17:12:03

Identifiants

Collections

Citation

Florian Brandner, Alexander Jordan. Refinement of worst-case execution time bounds by graph pruning. Computer Languages, Systems and Structures, Elsevier, 2014, 40 (3-4), pp.16. 〈http://www.journals.elsevier.com/computer-languages-systems-and-structures/〉. 〈10.1016/j.cl.2014.09.001〉. 〈hal-01108029〉

Partager

Métriques

Consultations de la notice

54