OASIcs.WCET.2008.1670.pdf
- Filesize: 164 kB
- 9 pages
Document
Improving the WCET computation time by IPET using control flow graph partitioning
Authors
- Publication date: 2008-11-13
- License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
-
Part of:
Volume:
8th International Workshop on Worst-Case Execution Time Analysis (WCET'08)
Series: Open Access Series in Informatics (OASIcs)
Conference: Workshop on Worst-Case Execution Time Analysis (WCET)
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)
https://doi.org/10.4230/OASIcs.WCET.2008.1670
https://doi.org/10.4230/OASIcs.WCET.2008.1670
Abstract
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.
Keywords
- Static analysis
- SESE regions
- ILP
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads