406 search results - page 15 / 82 » Boosting Using Branching Programs |
192
Voted
ASPLOS
2009
ACM
16 years 1 months ago
2009
ACM
Modern processors use branch target buffers (BTBs) to predict the target address of branches such that they can fetch ahead in the instruction stream increasing concurrency and pe...
109
Voted
JMLR
2012
13 years 2 months ago
2012
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...
97
Voted
CGO
2006
IEEE
15 years 4 months ago
2006
IEEE
Static compilers use profiling to predict run-time program behavior. Generally, this requires multiple input sets to capture wide variations in run-time behavior. This is expensiv...
HPCA
2008
IEEE
16 years 22 days ago
2008
IEEE
Hard-to-predict branches depending on longlatency cache-misses have been recognized as a major performance obstacle for modern microprocessors. With the widening speed gap between...
117
Voted
EUROSYS
2011
ACM
14 years 3 months ago
2011
ACM
Although they are helpful in many cases, state-of-the-art bug reporting systems may impose excessive overhead on users, leak private information, or provide little help to the dev...