Sciweavers

38 search results - page 3 / 8
» Benchmarking Domain-Specific Compiler Optimizations for Vari...
Sort
View
CGO
2006
IEEE
14 years 1 months ago
Exhaustive Optimization Phase Order Space Exploration
The phase-ordering problem is a long standing issue for compiler writers. Most optimizing compilers typically have numerous different code-improving phases, many of which can be a...
Prasad Kulkarni, David B. Whalley, Gary S. Tyson, ...
JUCS
2006
87views more  JUCS 2006»
13 years 7 months ago
Eliminating Redundant Join-Set Computations in Static Single Assignment
: The seminal algorithm developed by Ron Cytron, Jeanne Ferrante and colleagues in 1989 for the placement of -nodes in a control flow graph is still widely used in commercial compi...
Angela French, José Nelson Amaral
ICS
2001
Tsinghua U.
13 years 12 months ago
Global optimization techniques for automatic parallelization of hybrid applications
This paper presents a novel technique to perform global optimization of communication and preprocessing calls in the presence of array accesses with arbitrary subscripts. Our sche...
Dhruva R. Chakrabarti, Prithviraj Banerjee
CAEPIA
2005
Springer
14 years 1 months ago
Mapping Conformant Planning into SAT Through Compilation and Projection
Conformant planning is a variation of classical AI planning where the initial state is partially known and actions can have nondeterministic effects. While a classical plan must a...
Héctor Palacios, Hector Geffner
IEEEPACT
2006
IEEE
14 years 1 months ago
An empirical evaluation of chains of recurrences for array dependence testing
Code restructuring compilers rely heavily on program analysis techniques to automatically detect data dependences between program statements. Dependences between statement instanc...
Johnnie Birch, Robert A. van Engelen, Kyle A. Gall...