ACM Home Page
Please provide us with feedback. Feedback
Selective value prediction
Full text PdfPdf (133 KB)
Source International Symposium on Computer Architecture archive
Proceedings of the 26th annual international symposium on Computer architecture table of contents
Atlanta, Georgia, United States
Pages: 64 - 74  
Year of Publication: 1999
ISBN:0-7695-0170-2
Also published in ...
Authors
Brad Calder  Department of Computer Science and Engineering, University of California, San Diego
Glenn Reinman  Department of Computer Science and Engineering, University of California, San Diego
Dean M. Tullsen  Department of Computer Science and Engineering, University of California, San Diego
Sponsors
IEEE-CS\TCCA : TC on Computer Arhitecture
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 21,   Downloads (12 Months): 57,   Citation Count: 31
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/300979.300985
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
D.C. Burger and T. M. Austin. The simplescatar tool set, version 2.0. Technical Report CS-TR-97-1342, University of Wisconsin, Madison, June 1997.
 
4
 
5
B. Calder, P. Feller, and A. Eustaee. Value profiling and optimization. Journal of Instruction Level Parallelism, 1999.
 
6
7
 
8
 
9
 
10
R. J. Eickemeyer and S. Vassiliadis. A load instruction unit for pipelined processors. IBM Journal of Research and Development, 37:547-564, July I993.
 
11
E Gabbay and A. Mendelson. Speculative execution based on value prediction. EE Department TR 1080, Technion - Israel lnstitue of Technology, November 1996.
 
12
13
14
15
 
16
 
17
 
18
K.L. Lick, Hybrid Branch Prediction Using Limited Dual Path Execution. PhD thesis, University of California, Riverside, December t996.
19
 
20
 
21
S. McFarling, Combining branch predictors. Technical Report TN-36, Digital Equipment Corporation, Western Research Lab, June 1993.
 
22
 
23
G. Reinman, B. Calder, D. Tutlsen, G. Tyson, and T. Austin. Profile guided load marking for memory renaming. Technical Report UCSD- CS98-593, University of California, San Diego, July 1998.
 
24
 
25
 
26
27
 
28
 
29
D. Tullsen and B. Calder. Computing along the critical path. Technical report, University of California, San Diego, 1998.
 
30
31

CITED BY  31

Collaborative Colleagues:
Brad Calder: colleagues
Glenn Reinman: colleagues
Dean M. Tullsen: colleagues