Efficient longest executable path search for programs with complex flows and pipeline effects

Current development tools for embedded real-time systems do not efficiently support the timing aspect. The most important timing parameter for scheduling and system analysis is the Worst-Case Execution Time (WCET) of a program. This paper presents a fast and effective WCET calculation method that takes account of low-level machine aspects like pipelining and caches, and high-level program flow like loops and infeasible paths. The method is more efficient than previous path-based approaches, and can easily handle complex programs. By separating the low-level from the high-level analysis, the method is easy to retarget. Experiments confirm that speed does not sacrifice precision, and that programs with extreme numbers of potential execution paths can be analyzed quickly. Keywords WCET, hard real-time, embedded systems, path search, program flow, pipeline timing

• Type: Conference
• Year: 2001
• Where: CASES
• Authors: Friedhelm Stappert, Andreas Ermedahl, Jakob Engblom
• Keywords: CASES 2001, Important Timing Parameter, Program Flow, System Software, WCET Calculation Method