Using Polyhedral Techniques to Tighten WCET Estimates of Optimized Code: A Case Study with Array Contraction - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Using Polyhedral Techniques to Tighten WCET Estimates of Optimized Code: A Case Study with Array Contraction

(1) , (2) , (1, 3) , (1, 3) , (4) , (1, 5) , (4)
1
2
3
4
5

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 paper, 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.
Fichier principal
Vignette du fichier
DATE_2018.pdf (232.52 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01815499 , version 1 (14-06-2018)

Identifiers

Cite

Thomas Lefeuvre, Emin Koray Kasnakli, Imen Fassi, Isabelle Puaut, Christoph Cullmann, et al.. Using Polyhedral Techniques to Tighten WCET Estimates of Optimized Code: A Case Study with Array Contraction. DATE 2018 - Design Automation and Test Europe, Mar 2018, Dresden, Germany. pp.925-930, ⟨10.23919/DATE.2018.8342142⟩. ⟨hal-01815499⟩
469 View
159 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More