376 search results - page 1 / 76 » Evaluating Heuristic Optimization Phase Order Search Algorit... |
CGO
2007
IEEE
13 years 11 months ago
2007
IEEE
Program-specific or function-specific optimization phase sequences are universally accepted to achieve better overall performance than any fixed optimization phase ordering. A ...
LCTRTS
2010
Springer
13 years 2 months ago
2010
Springer
The issues of compiler optimization phase ordering and selection present important challenges to compiler developers in several domains, and in particular to the speed, code size,...
CGO
2006
IEEE
13 years 11 months ago
2006
IEEE
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...
PLDI
2004
ACM
13 years 10 months ago
2004
ACM
It has long been known that a fixed ordering of optimization phases will not produce the best code for every application. One approach for addressing this phase ordering problem ...
EVOW
2007
Springer
13 years 11 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...