A Framework for Calculating WCET Based on Execution Decision Diagrams

Abstract

Due to the dynamic behaviour of acceleration mechanisms such as caches and branch predictors, static Worst-Case Execution Time ( wcet ) analysis methods tend to scale poorly to modern hardware architectures. As a result, a trade-off must be found between the duration and the precision of the analysis, leading to an overestimation of the wcet bounds. In turn, this reduces the schedulability and resource usage of the system. In this paper we present a new data structure to speed up the analysis: the eXecution Decision Diagram ( xdd ), which is an ad-hoc extension of Binary Decision Diagrams tailored for wcet analysis problems. We show how xdd s can be used to represent efficiently execution states in a modern hardware platform. Moreover, we propose a new process to build the Integer Linear Programming system of the Implicit Path Enumeration Technique using xdd . We use benchmark applications to demonstrate how the use of an xdd substantially increases the scalability of wcet analysis and the precision of the obtained wcet .