Download:
by Huiyang Zhou, Jill Flanagan, Thomas M. Conte
In Proc. of the 30th Annual Intl. Symp. on Computer Architecture
http://www.tinker.ncsu.edu/symposia/isca03.pdf
Add To MetaCart
Abstract:
Value prediction exploits localities in value streams. Previous research focused on exploiting two types of value localities, computational and context-based, in the local value history, which is the value sequence produced by the same instruction that is being predicted. Besides the local value history, value locality also exists in the global value history, which is the value sequence produced by all dynamic instructions according to their execution order. In this paper, a new type value locality, the computational locality in the global value history is studied. A novel prediction scheme, called the gDiff predictor, is designed to exploit one special and most common case of this computational model, the stridebased computation, in the global value history. Such a scheme provides a general framework to exploit global stride locality in any value stream. Experiments show that there exists very strong stride type of locality in global value sequences. Ideally, the gDiff predictor can achieve 73 % prediction accuracy for all value producing instructions without any hybrid scheme, much higher than local stride and local context prediction schemes. However, the capability of realistically exploiting locality in global value history is greatly challenged by the value delay issue, i.e., the correlated value may not be available when the prediction is being made. We study the value delay issue in an out-of-order (OOO) execution pipeline model and propose a new hybrid scheme to maximize the exploitation of the global stride locality. This new hybrid scheme shows 91 % prediction accuracy and 64% coverage for all value producing instructions. We also show that the global stride locality detected by gDiff in load address streams provides strong capabilities in predicting load addresses (coverage 63 % and accuracy 86%) and in predicting addresses of missing loads (33% coverage and 53 % accuracy). 1.
Citations
|
314
|
Value Locality and Load Value Prediction
– Lipasti, Wilkerson, et al.
- 1996
|
|
246
|
Exceeding the Dataflow Limit via Value Prediction
– Lipasti, Shen
- 1996
|
|
221
|
The predictability of data values
– Sazeides, Smith
- 1997
|
|
195
|
D.Grunwald, “Prefetching Using Markov Predictors
– Joseph
- 1999
|
|
172
|
Highly Accurate Data Value Prediction using Hybrid Predictors
– Wang, Franklin
- 1997
|
|
141
|
Speculative execution based on value prediction
– Gabbay, Mendelson
- 1996
|
|
92
|
Increasing Processor Performance by Implementing Deeper Pipelines
– Sprangle, Carmean
- 2002
|
|
83
|
Dynamic Branch Prediction with Perceptrons
– Jimenez, Lin
- 2001
|
|
63
|
Can Program Profiling Support Value Prediction
– Gabbay, Mendelson
- 1997
|
|
54
|
Focusing Processor Policies via Critical-Path Prediction
– Fields, Rubin, et al.
- 2001
|
|
41
|
Efficacy and Performance Impact of Value Prediction
– Rychlik, Faistl, et al.
- 1998
|
|
34
|
The SimpleScalar tool set, v2.0
– Burger, Austin
- 1997
|
|
29
|
Value prediction for speculative multithreaded architectures
– Marcuello, Tubella, et al.
- 1999
|
|
25
|
The effect of speculatively updating branch history on branch prediction accuracy
– Hao, Chang, et al.
- 1994
|
|
23
|
Value speculation scheduling for high performance processors
– Fu, Jennings, et al.
- 1998
|
|
23
|
Improving Branch Predictors by Correlating on Data Values
– Heil, Smith, et al.
- 1999
|
|
22
|
Exploring Last n Value Prediction
– Burtscher, Zorn
- 1999
|
|
21
|
ªDifferential FCM: Increasing Value Prediction Accuracy by Improving Table Usage Efficiency,º
– Goeman, Vandierendonck, et al.
- 2001
|
|
20
|
On Some Implementation Issues for Value Prediction on Wide-Issue
– Lee, Yew
- 2000
|
|
18
|
Decoupled value prediction on trace processors
– Lee, Wang, et al.
- 2000
|
|
18
|
Global Context-Based Value Prediction
– Nakra, Gupta, et al.
- 1999
|
|
9
|
Compiler Controlled Value Prediction using Branch Predictor Based Confidence
– Larson, Austin
- 2000
|
|
9
|
Available parallelism with data value prediction
– Sathe, Franklin
- 1998
|
|
5
|
Better exploration of regionlevel value locality with integrated computation reuse and value prediction
– Wu, Chen, et al.
- 2001
|
|
4
|
Using Dataflow Based Context for Accurate Value Prediction
– Thomas, Franklin
- 2001
|
|
2
|
Exploiting computational locality in global value histories
– Bodine
- 2002
|
|
2
|
Modeling value prediction
– Sazeides
- 2002
|
|
2
|
Dynamic prediction of critical instructions
– Tune, Liang, et al.
- 2001
|
|
1
|
Predictive Techniques for aggressive local speculation
– Reinman, Calder
- 2000
|
|
1
|
Memory performance analysis of
– Serrano, Wu
- 2001
|