International audienceCompiler optimizations, although reducing the execution times of programs, raise issues in static WCET estimation techniques and tools. Flow facts, such as loop bounds, may not be automatically found by static WCET analysis tools after aggressive code optimizations. In this paper, we explore the use of iterative compilation (WCET-directed program optimization to explore the optimization space), with the objective to (i) allow flow facts to be automatically found and (ii) select optimizations that result in the lowest WCET estimates. We also explore to which extent code outlining helps, by allowing the selection of different optimization options for different code snippets of the application
The worst-case execution time (WCET) being the upper bound of the maximum execution time corresponds...
In the domain of the worst-case execution time (WCET) analysis, loops are an inherent source of unpr...
International audienceThe ARGO H2020 European project aims at developing a Worst-Case Execution Time...
International audienceCompiler optimizations, although reducing the execution times of programs, rai...
International audienceStatic Worst-Case Execution Time (WCET) estimation techniques take as input th...
International audienceReal-time systems have become ubiquitous. For this class of systems, correctne...
International audienceReal-time systems have become ubiquitous, and many play an important role in o...
Static Worst-Case Execution Time (WCET) ana-lysis is a technique to derive upper bounds for the ex-e...
It is advantageous to perform compiler optimizations to lower the WCET of a task since tasks with lo...
Standard static WCET analysis methods today are based on the IPET technique, where WCET estimation i...
The fact that many benchmarks for evaluating worst-case execution time (WCET) analysis tools are bas...
While iterative optimization has become a popular compiler optimization approach, it is based on a p...
International audienceIn this paper, we propose a static worst- case execution time (WCET) analysis ...
The worst-case execution time (WCET) being the upper bound of the maximum execution time corresponds...
In the domain of the worst-case execution time (WCET) analysis, loops are an inherent source of unpr...
International audienceThe ARGO H2020 European project aims at developing a Worst-Case Execution Time...
International audienceCompiler optimizations, although reducing the execution times of programs, rai...
International audienceStatic Worst-Case Execution Time (WCET) estimation techniques take as input th...
International audienceReal-time systems have become ubiquitous. For this class of systems, correctne...
International audienceReal-time systems have become ubiquitous, and many play an important role in o...
Static Worst-Case Execution Time (WCET) ana-lysis is a technique to derive upper bounds for the ex-e...
It is advantageous to perform compiler optimizations to lower the WCET of a task since tasks with lo...
Standard static WCET analysis methods today are based on the IPET technique, where WCET estimation i...
The fact that many benchmarks for evaluating worst-case execution time (WCET) analysis tools are bas...
While iterative optimization has become a popular compiler optimization approach, it is based on a p...
International audienceIn this paper, we propose a static worst- case execution time (WCET) analysis ...
The worst-case execution time (WCET) being the upper bound of the maximum execution time corresponds...
In the domain of the worst-case execution time (WCET) analysis, loops are an inherent source of unpr...
International audienceThe ARGO H2020 European project aims at developing a Worst-Case Execution Time...