Sciweavers

Share
RTS
2000

Fast and Precise WCET Prediction by Separated Cache and Path Analyses

12 years 1 months ago
Fast and Precise WCET Prediction by Separated Cache and Path Analyses
Precise run-time prediction suffers from a complexity problem when doing an integrated analysis. This problem is characterised by the conflict between an optimal solution and the complexity of the computation of the solution. The analysis of modern hardware consists of two parts: a) the analysis of the microarchitecture's behaviour (caches, pipelines) and b) the search for the longest program path. Because an integrated analysis has a significant computational complexity, we chose to separate these two steps. By this, an ordering problem arises, because the steps depend on each other. In this paper we show how the microarchitecture analysis can be separated from the path analysis in order to make the overall analysis fast. Practical experiments will show that this separation, however, does not make the analysis more pessimistic than existing approaches. Furthermore, we show that the approach can be used to analyse executables created by a standard optimising compiler.
Henrik Theiling, Christian Ferdinand, Reinhard Wil
Added 19 Dec 2010
Updated 19 Dec 2010
Type Journal
Year 2000
Where RTS
Authors Henrik Theiling, Christian Ferdinand, Reinhard Wilhelm
Comments (0)
books