ACM Home Page
Please provide us with feedback. Feedback
Value prediction in VLIW machines
Full text PdfPdf (226 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: 258 - 269  
Year of Publication: 1999
ISBN:0-7695-0170-2
Also published in ...
Authors
Tarun Nakra  Department of Computer Science, University of Pittsburgh
Rajiv Gupta  Department of Computer Science, University of Pittsburgh
Mary Lou Soffa  Department of Computer Science, University of Pittsburgh
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): 11,   Downloads (12 Months): 26,   Citation Count: 5
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.301001
What is a DOI?

ABSTRACT

The performance of VLIW architectures is dependent on the capability of the compiler to detect and exploit instruction-level parallelism during instruction scheduling. To exploit the detected parallelism, instructions are reordered to reduce the length of the code schedule and minimize the cycle count for execution. Code reordering is limited by the dependencies among instructions arising from both control flow and data flow. In this paper, we present the design of a VLIW architecture that uses value prediction to remove data dependencies and improve the instruction schedule. Our architecture consists of two execution engines, one for executing the original VLIW code, and the other for executing compensation code after a misprediction. Any code executed due to mispredictions is executed in parallel with the VLIW instructions. The instruction set and hardware of a traditional VLIW machine are modified accordingly to support this type of concurrent execution. The efficacy of the proposed architecture is demonstrated by implementing the prediction model in the Trimaran compiler infrastructure and studying the speedups that result due to the parallel execution of compensation code.


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
The trimaran compiler research infrastructure. Tutorial Notes, November 1997.
 
2
 
3
J. Fisher. Trace scheduling: a technique for global microcode compaction. IEEE Tranactions on Computers, July t981.
4
 
5
F. Gabbay and A. Mendelson. Speculative execution based on value prediction. EE Department TR# t080, Technion- Israel Institute of Technology, November t996.
 
6
 
7
 
8
V. Kathail, M. Schlansker, and B. R. Rau. Hpl playdoh architecture specification: Version 1.0. HewIett- Packard Laboratories Technical Report HPL-93-80, Computer Systems Laboratory, February 1994.
 
9
10
11
 
12
 
13
 
14
M. Schlansker, B. R. Ran, S. Mahlke, V. Kathail, R.Johnson, S.Anik, and S. G. Abraham. Achieving high levels of instruction-level parallelism with reduced hardware complexity. Hewtett-Packard Laboratories Technical Report HPL-960120, Hewlett-Packard Laboratories, February 1997.
 
15


Collaborative Colleagues:
Tarun Nakra: colleagues
Rajiv Gupta: colleagues
Mary Lou Soffa: colleagues