Selective value prediction
Brad Calder, Glenn Reinman, Dean Michael Tullsen · 1999
Value Prediction is a relatively new technique to increase instruction-level parallelism by breaking true data dependence chains. A value prediction architecture produces values, which may be later consumed by instructions that execute speculatively using the predicted value. This paper examines selective techniques for using value prediction in the presence of predictor capacity constraints and reasonable misprediction penalties. We examine prediction and confidence mechanisms in light of these constraints, and we minimize capacity conflicts through instruction filtering. The latter technique filters which instructions put values into the value prediction table. We examine filtering techniques based on instruction type, as well as giving priority to instructions belonging to the longest data dependence path in the processor’s active instruction window. We apply filtering both to the producers of predicted values and the consumers. In addition, we examine the benefit of using different confidence levels for instructions using predicted values on the longest dependence path. 1
Cited by 179 works. doi:10.1145/300979.300985
Authors
References
- The SimpleScalar tool set, version 2.0
- A comparison of dynamic branch predictors that use two levels of branch history
- Value locality and load value prediction
- Trace Cache: A Low Latency Approach to High Bandwidth Instruction Fetching
- Effective hardware-based data prefetching for high-performance processors
- Assigning confidence to conditional branch predictions
- Exceeding the Dataflow Limit via Value Prediction
- The Alpha 21264 microprocessor architecture
- Optimization of instruction fetch mechanisms for high issue rates
- Confidence estimation for speculation control