ACM Home Page
Please provide us with feedback. Feedback
Modeling program predictability
Full text PdfPdf (1.49 MB)
Source International Symposium on Computer Architecture archive
Proceedings of the 25th annual international symposium on Computer architecture table of contents
Barcelona, Spain
Pages: 73 - 84  
Year of Publication: 1998
ISBN:0-8186-8491-7
Also published in ...
Authors
Yiannakis Sazeides  Department of Electrical and Computer Engineering, University of Wisconsin-Madison, 1415 Engr. Dr., Madison, WI
James E. Smith  Department of Electrical and Computer Engineering, University of Wisconsin-Madison, 14 15 Engr. Dr., Madison, WI
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): 6,   Downloads (12 Months): 28,   Citation Count: 15
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/279358.279371
What is a DOI?

ABSTRACT

Basic properties of program predictability --- for both values and control --- are defined and studied. We take the view that program predictability originates at certain points during a program's execution, flows through subsequent instructions, and then ends at other points in the program. These key components of predictability: generation, propagation, and termination; are defined in terms of a model. The model is based on a graph derived from dynamic data dependences and a predictor.Using the SPEC95 benchmarks, we analyze the predictability phenomena both separately and in combination. Examples are provided to illustrate relationships between model-based characteristics and program constructs. It is shown that most predictability derives from program control structure and immediate values, not program input data. Furthermore, most predictability originates from a relatively small number of generate points. The analysis of obtained results suggests a number of ramifications regarding predictability and its use.


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.

 
2
 
3
D. Burger, T. M. Austin, and S. Bennett. Evaluating Future Microprocessors: The SimpleScalar Tool Set. Technical Report CS-TR-96-1308, University of Wisconsin-Madison, July 1996.
 
4
C. Consel, L. Hornof, F. Noel, J. Noye, and N. Volanschi. A Uniform Approach for Compile and Run-time Specialization. Technical Report 979, INRIA, December 1995.
 
5
R.J. Eickemeyer and S. Vassiliadis. A Load Instruction Unit for Pipelined Processors. IBM Journal of Research and Development, 37(4):547-564, July 1993.
 
6
J. A. Fisher. Trace Scheduling: A Technique for Global Microcode Compaction. IEEE Transactions on Computers, 30(7):478-490, July 1981.
 
7
E Gabbay and A. Mendelson. Speculative Execution Based on Value Prediction. Technical Report (Available from http://www-ee.technion.ac.il/fredg), Technion, Nov. 1996.
 
8
 
9
10
 
11
S. McFarling. Combining Branch Predictors. Technical Report DEC WRL TN-36, Digital Western Research Laboratory, June 1993.
 
12
 
13
Y. Sazeides and J. E. Smith. Implementations of Context- Based Value Predictors. Technical Report ECE-TR-97-8, University of Wisconsin-Madison, Dec. 1997.
 
14
 
15
16
 
17
18

CITED BY  15

Collaborative Colleagues:
Yiannakis Sazeides: colleagues
James E. Smith: colleagues