Using Polyhedral Techniques to Tighten WCET Estimates of Optimized Code: A Case Study with Array Contraction
Thomas Lefeuvre1, Imen Fassi1, Christoph Cullmann2, A. Gernot Gebhard2, Emin Koray Kasnakli3, Isabelle Puaut1 and Steven Derrien1
1Univ. Rennes 1/IRISA
2AbsInt GmbH Steven
3Fraunhofer IIS
ABSTRACT
The ARGO H2020 European project aims at developing a Worst‐Case Execution Time (WCET)‐aware parallelizing compilation toolchain. This toolchain operates on Scilab and XCoS inputs, and targets ScratchPad memory (SPM)‐based multi‐cores. Data‐layout and loop transformations play a key role in this flow as they improve SPM efficiency and reduce the number of accesses to shared main memory. In this paper1, we study how these transformations impact WCET estimates of sequential codes. We demonstrate that they can bring significant improvements of WCET estimates (up to 2.7×) provided that the WCET analysis process is guided with automatically generated flow annotations obtained using polyhedral counting techniques.
