[Back]

F. Brandner, S Hepp, A. Jordan:
"Static profiling of the worst-case in real-time programs";
Talk: International Conference on Real-Time and Network Systems (RTNS), Pont a Mousson; 2012-11-08 - 2012-11-09; in: "Proceedings of the 20th International Conference on Real-Time and Network Systems", C. Rochange, J. Anderson (ed.); ACM, (2012), ISBN: 978-1-4503-1409-1; 101 - 110.

With the increasing performance demand in real-time systems it becomes more and more relevant to provide feedback to engineers and programmers, but also software development tools, on the performance-relevant code parts of a real-time program. So far, the information provided to programmers through tools was limited to an estimation of the worst-case execution time (WCET) and its associated worst-case execution path (WCEP). However, these metrics only provide partial information. Only those code parts that are on one of the WCEPs are indicated to the programmer. No information is provided for all other code parts. To give an accurate view covering the entire code base, tools in the spirit of standard program profiling tools are required.

This work proposes an efficient approach to compute worst-case timing information for all code parts of a program using a complementary metric, called criticality. Every statement of a real-time program is assigned a criticality value, expressing how critical the respective code is with respect to the global WCET. This gives an accurate view to programmers how close the worst execution path passing through a specific part of a real-time program is to the global WCEP. We formally define the criticality metric and investigate some of its properties with respect to dominance in control-flow graphs. Exploiting some of those properties, we propose an algorithm that reduces the overhead of computing the metric to cover complete real-time programs.

Criticality, Worst-Case Execution Time, Program Profiling, Program Analysis

http://dx.doi.org/10.1145/2392987.2393000