Improving the WCET computation time by IPET using control flow graph partitioning

Authors Clément Ballabriga, Hugues Cassé

Thumbnail PDF


  • Filesize: 164 kB
  • 9 pages

Document Identifiers

Author Details

Clément Ballabriga
Hugues Cassé

Cite AsGet BibTex

Clément Ballabriga and Hugues Cassé. Improving the WCET computation time by IPET using control flow graph partitioning. In 8th International Workshop on Worst-Case Execution Time Analysis (WCET'08). Open Access Series in Informatics (OASIcs), Volume 8, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)


Implicit Path Enumeration Technique (IPET) is currently largely used to compute Worst Case Execution Time (WCET) by modeling control flow and architecture using integer linear programming (ILP). As precise architecture effects requires a lot of constraints, the super-linear complexity of the ILP solver makes computation times bigger and bigger. In this paper, we propose to split the control flow of the program into smaller parts where a local WCET can be computed faster - as the resulting ILP system is smaller - and to combine these local results to get the overall WCET without loss of precision. The experimentation in our tool OTAWA with lp_solve solver has shown an average computation improvement of 6.5 times.
  • Static analysis
  • SESE regions
  • ILP


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads