Accelerating WCET-driven optimizations by the invariant path paradigm
Paul Lokuciejewski, Fatih Gedikli, Peter Marwedel · 2009
The worst-case execution time (WCET) being the upper bound of the maximum execution time corresponds to the longest path through the program's control flow graph. Its reduction is the objective of a WCET optimization. Unlike average-case execution time compiler optimizations which consider a static (most frequently executed) path, the longest path is variable since its optimization might result in another path becoming the effective longest path.