84 search results - page 2 / 17 » Reducing Branch Costs via Branch Alignment |
PLDI
1998
ACM
13 years 9 months ago
1998
ACM
The conditional branch has long been considered an expensive operation. The relative cost of conditional branches has increased as recently designed machines are now relying on de...
IPPS
2008
IEEE
13 years 12 months ago
2008
IEEE
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...
IPPS
2005
IEEE
13 years 11 months ago
2005
IEEE
Current processors exploit out-of-order execution and branch prediction to improve instruction level parallelism. When a branch prediction is wrong, processors flush the pipeline ...
SAC
2006
ACM
13 years 11 months ago
2006
ACM
Modern embedded processors access the Branch Target Buffer (BTB) every cycle to speculate branch target addresses. Such accesses, quite often, are unnecessary as there is no branc...
PLDI
2005
ACM
13 years 11 months ago
2005
ACM
Code placement techniques have traditionally improved instruction fetch bandwidth by increasing instruction locality and decreasing the number of taken branches. However, traditio...