Sciweavers

322 search results - page 43 / 65
» Counting Dependence Predictors
Sort
View
INFOCOM
2012
IEEE
13 years 5 days ago
The Bloom paradox: When not to use a Bloom filter?
—In this paper, we uncover the Bloom paradox in Bloom filters: sometimes, it is better to disregard the query results of Bloom filters, and in fact not to even query them, thus...
Ori Rottenstreich, Isaac Keslassy
HPCA
2007
IEEE
15 years 10 months ago
Improving Branch Prediction and Predicated Execution in Out-of-Order Processors
If-conversion is a compiler technique that reduces the misprediction penalties caused by hard-to-predict branches, transforming control dependencies into data dependencies. Althou...
Eduardo Quiñones, Joan-Manuel Parcerisa, An...
MICRO
2002
IEEE
131views Hardware» more  MICRO 2002»
15 years 2 months ago
Pointer cache assisted prefetching
Data prefetching effectively reduces the negative effects of long load latencies on the performance of modern processors. Hardware prefetchers employ hardware structures to predic...
Jamison D. Collins, Suleyman Sair, Brad Calder, De...
TC
2002
14 years 9 months ago
On Augmenting Trace Cache for High-Bandwidth Value Prediction
Value prediction is a technique that breaks true data dependences by predicting the outcome of an instruction and speculatively executes its data-dependent instructions based on th...
Sang Jeong Lee, Pen-Chung Yew
WWW
2009
ACM
15 years 10 months ago
A search-based method for forecasting ad impression in contextual advertising
Contextual advertising (also called content match) refers to the placement of small textual ads within the content of a generic web page. It has become a significant source of rev...
Xuerui Wang, Andrei Z. Broder, Marcus Fontoura, Va...