1294 search results - page 122 / 259 » FFT Compiler Techniques |
119
click to vote
CC
2006
Springer
15 years 7 months ago
2006
Springer
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...
120
Voted
ICCAD
1995
IEEE
15 years 7 months ago
1995
IEEE
This paper addresses the problem of speeding up functional (delayindependent)logic simulation for synchronousdigital systems. The problem needs very little new motivation – cycl...
154
Voted
ICFP
2010
ACM
15 years 3 months ago
2010
ACM
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...
145
click to vote
CJ
1999
15 years 3 months ago
1999
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...
135
Voted
CGO
2008
IEEE
15 years 10 months ago
2008
IEEE
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...