200 search results - page 8 / 40 » On the decidability of phase ordering problem in optimizing ... |
143
click to vote
EGH
2005
Springer
15 years 10 months ago
2005
Springer
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...
138
click to vote
POPL
2010
ACM
15 years 11 months ago
2010
ACM
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
184
click to vote
IEEEPACT
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—Optimizing compilers apply numerous interdependent optimizations, leading to the notoriously difficult phase-ordering problem — that of deciding which transformations...
164
click to vote
CP
2008
Springer
15 years 6 months ago
2008
Springer
Modern computer architectures have complex features that can only be fully taken advantage of if the compiler schedules the compiled code. A standard region of code for scheduling ...
143
click to vote
FLAIRS
2008
15 years 6 months ago
2008
In machine learning, decision trees are employed extensively in solving classification problems. In order to design a decision tree classifier two main phases are employed. The fi...