Sciweavers

1294 search results - page 206 / 259
» FFT Compiler Techniques
Sort
View
EUROPAR
2007
Springer
14 years 4 months ago
Compositional Approach Applied to Loop Specialization
An optimizing compiler has a hard time to generate a code which will perform at top speed for an arbitrary data set size. In general, the low level optimization process must take i...
Lamia Djoudi, Jean-Thomas Acquaviva, Denis Barthou
HIPEAC
2007
Springer
14 years 4 months ago
MiDataSets: Creating the Conditions for a More Realistic Evaluation of Iterative Optimization
Abstract. Iterative optimization has become a popular technique to obtain improvements over the default settings in a compiler for performance-critical applications, such as embedd...
Grigori Fursin, John Cavazos, Michael F. P. O'Boyl...
PROVSEC
2007
Springer
14 years 4 months ago
Formal Proof of Provable Security by Game-Playing in a Proof Assistant
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...
Reynald Affeldt, Miki Tanaka, Nicolas Marti
ICAC
2006
IEEE
14 years 4 months ago
A Runtime Adaptation Framework for Native C and Bytecode Applications
— The need for self-healing software to respond with a reactive, proactive or preventative action as a result of changes in its environment has added the non-functional requireme...
Rean Griffith, Gail E. Kaiser
IEEEPACT
2006
IEEE
14 years 4 months ago
Region array SSA
Static Single Assignment (SSA) has become the intermediate program representation of choice in most modern compilers because it enables efficient data flow analysis of scalars an...
Silvius Rus, Guobin He, Christophe Alias, Lawrence...