search for: wcet

...used abbreviations meanwhile changed or I mixed up something else. Regarding the fact, that it is not possible to have a 1:1 mapping between LLVM instructions and native code instructions in the general case. That is clear, it is the same problem as it is with Java Byte Code. Some work dealing with WCET analysis of Java Byte Code already has been done: Iain Bate, Guillem Bernat, Greg Murphy, Peter Puschner: Low-Level Analysis of a Portable Java Byte Code WCET Analysis Framework Guillem Bernat, Alan Burns, Andy Wellings: Portable Worst-Case Execution Time Analysis Using Java Byte Code I just won...

On Apr 3, 2007, at 10:55 AM, Andrew Lenharth wrote: > On 4/2/07, Fabian Scheler <fabian.scheler at gmail.com> wrote: >> Hello everybody, >> >> I'm curious whether there have been any attempts to perform >> performance analysis on the LLVA level. I am interested in the >> derivation of flow-facts (loop bounds etc. - what about the >>

Hello everybody, I'm curious whether there have been any attempts to perform performance analysis on the LLVA level. I am interested in the derivation of flow-facts (loop bounds etc. - what about the value-range-propagation pass I read about on this list some time ago) but even more I am interested in exec-time modeling (how long does it take to execute a bunch of LLVA instructions on

On 4/2/07, Fabian Scheler <fabian.scheler at gmail.com> wrote: > Hello everybody, > > I'm curious whether there have been any attempts to perform > performance analysis on the LLVA level. I am interested in the > derivation of flow-facts (loop bounds etc. - what about the > value-range-propagation pass I read about on this list some time ago) > but even more I am

Hello everybody, I'd like to know if there is way to extend an LLVM-backend outside the LLVM-tree. I am working on a transformation system between time- and event-triggered real-time systems and at some point I need to do a WCET analysis. Herefore, I extended the AsmPrinter to give me the asm code for every single basic block. This code then is analyzed by some external tool and the analysis results are fed back into a high-level WCET analysis (i.e. generating and solving the linear program). Currently I just duplicated t...

...t; which > represents > the hierarchical structure of the input program. I am not sure if my definition of a control flow tree is the same as yours, but if it is, I am very interested. For my recent Ph.D. work, I created control flow trees from Java bytecode in order to calculate the WCET of a program. Operating on a CFT instead of a CFG makes the calculation much faster because, in many cases, one can simply perform a recursive descent into the tree (a linear operation), rather than formulating an ILP problem from the CFG and waiting for an ILP solver to do its thing (an ex...

Hi folks, A few months back I finished writing and testing a pass which implements "structural analysis" as described originally by Sharir in 1980 ("Structural analysis: A new approach to flow analysis in optimizing compilers") and more recently by Muchnick in Advanced Compiler Design and Implementation. It analyses the CFG and recognises specific region schema, such as

...wn. What do you think? Would this pass be useful for others except for me? Is there any related work? I've found [1], but they do not use LLVM and it seems to specialized to me. Cheers, Sebastian [1]: Knoop, J., Kovács, L., & Zwirchmayr, J. (2012). Symbolic loop bound computation for wcet analysis. In Perspectives of Systems Informatics (pp. 227-242). Springer Berlin, Heidelberg. http://www.complang.tuwien.ac.at/lkovacs/pub/PSI11_Kovacs.pdf -- Mit freundlichen Grüßen / Kind regards Sebastian Dreßler Zuse Institute Berlin (ZIB) Takustraße 7 D-14195 Berlin-Dahlem Germany dressler...

Hello people I'm studying worst case execution time calculation (WCET) and I'm planing use LLVM to develop a tool to calculate the maximum execution time of a real time program. Is there any project or initiative of using LLVM to real time systems and, specifically to calculate execution times? Does anyone have any hint? I'm reading the LLVM documentation a...

Hi Duncan, Am Thursday, 11. August 2011, 15:56:22 schrieb Duncan Sands: > Hi Florian, > > > we'd like to be able to check for loss of information in trunc operations > > in our LLVM-based bounded model checker [1]. For this it is important if > > the trunc was on a signed or unsigned integer, so we need nsw and nuw > > flags for this. Would you accept a patch