Sciweavers

1294 search results - page 122 / 259
» FFT Compiler Techniques
Sort
View
CC
2006
Springer
129views System Software» more  CC 2006»
14 years 19 days ago
Loop Transformations in the Ahead-of-Time Optimization of Java Bytecode
Abstract. Loop optimizations such as loop unrolling, unfolding and invariant code motion have long been used in a wide variety of compilers to improve the running time of applicati...
Simon Hammond, David Lacey
ICCAD
1995
IEEE
110views Hardware» more  ICCAD 1995»
14 years 13 days ago
Fast functional simulation using branching programs
This paper addresses the problem of speeding up functional (delayindependent)logic simulation for synchronousdigital systems. The problem needs very little new motivation – cycl...
Pranav Ashar, Sharad Malik
ICFP
2010
ACM
13 years 9 months ago
ReCaml: execution state as the cornerstone of reconfigurations
Most current techniques fail to achieve the dynamic update of recursive functions. A focus on execution states appears to be essential in order to implement dynamic update in this...
Jérémy Buisson, Fabien Dagnat
CJ
1999
126views more  CJ 1999»
13 years 8 months ago
Source Level Static Branch Prediction
The ability to predict the directions of branches, especially conditional branches, is an important problem in modern computer architecture and advanced compilers. Many static and...
W. F. Wong
CGO
2008
IEEE
14 years 3 months ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...