Sciweavers

34 search results - page 2 / 7
» Dynamic Branch Prediction for a VLIW Processor
Sort
View
HPCA
1998
IEEE
13 years 9 months ago
Supporting Highly-Speculative Execution via Adaptive Branch Trees
Most of the prediction mechanisms predict a single path to continue the execution on a branch. Alternatively, we may exploit parallelism from either possible paths of a branch, di...
Tien-Fu Chen
APCSAC
2007
IEEE
13 years 11 months ago
Unbiased Branches: An Open Problem
The majority of currently available dynamic branch predictors base their prediction accuracy on the previous k branch outcomes. Such predictors sustain high prediction accuracy but...
Arpad Gellert, Adrian Florea, Maria Vintan, Colin ...
ISCA
1998
IEEE
102views Hardware» more  ISCA 1998»
13 years 9 months ago
Dynamic History-length Fitting: A Third Level of Adaptivity for Branch Prediction
Accurate branch prediction is essential for obtaining high performance in pipelined superscalar processors that execute instructions speculatively. Some of the best current predic...
Toni Juan, Sanji Sanjeevan, Juan J. Navarro
PLDI
2005
ACM
13 years 11 months ago
Code placement for improving dynamic branch prediction accuracy
Code placement techniques have traditionally improved instruction fetch bandwidth by increasing instruction locality and decreasing the number of taken branches. However, traditio...
Daniel A. Jiménez
CASES
2007
ACM
13 years 9 months ago
A backtracking instruction scheduler using predicate-based code hoisting to fill delay slots
Delayed branching is a technique to alleviate branch hazards without expensive hardware branch prediction mechanisms. For VLIW processors with deep pipelines and many issue slots,...
Tom Vander Aa, Bingfeng Mei, Bjorn De Sutter