Sciweavers

315 search results - page 8 / 63
» Improving Performance by Branch Reordering
Sort
View
EUROPAR
2000
Springer
13 years 11 months ago
On the Performance of Fetch Engines Running DSS Workloads
Abstract This paper examines the behavior of current and next generation microprocessors' fetch engines while running Decision Support Systems (DSS) workloads. We analyze the ...
Carlos Navarro, Alex Ramírez, Josep-Lluis L...
MASCOTS
2004
13 years 9 months ago
Is TCP Packet Reordering Always Harmful?
IP networks do not provide any guarantee that packets belonging to the same flow are delivered in the correct order. It can be argued that out-of-order reception of packets is lim...
Giovanni Neglia, Vincenzo Falletta, Giuseppe Bianc...
IPPS
2008
IEEE
14 years 1 months ago
Low power/area branch prediction using complementary branch predictors
Although high branch prediction accuracy is necessary for high performance, it typically comes at the cost of larger predictor tables and/or more complex prediction algorithms. Un...
Resit Sendag, Joshua J. Yi, Peng-fei Chuang, David...
HPCA
2004
IEEE
14 years 7 months ago
Reducing Branch Misprediction Penalty via Selective Branch Recovery
Branch misprediction penalty consists of two components: the time wasted on mis-speculative execution until the mispredicted branch is resolved and the time to restart the pipelin...
Amit Gandhi, Haitham Akkary, Srikanth T. Srinivasa...
ICCD
1997
IEEE
78views Hardware» more  ICCD 1997»
13 years 11 months ago
Speeding up Variable Reordering of OBDDs
In this paper, we suggest a block-restricted sifting strategy which is based on the restriction of Rudell's sifting to certain blocks of variables. The application of this st...
Christoph Meinel, Anna Slobodová