ACM Home Page
Please provide us with feedback. Feedback
Tolerating data access latency with register preloading
Full text pdf formatPdf (971 KB)
Source International Conference on Supercomputing archive
Proceedings of the 6th international conference on Supercomputing table of contents
Washington, D. C., United States
Pages: 104 - 113  
Year of Publication: 1992
ISBN:0-89791-485-6
Authors
Sponsor
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 5,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/143369.143394
What is a DOI?

ABSTRACT

By exploiting fine grain parallelism, superscalar processors can potentially increase the performance of future supercomputers. However, supercomputers typically have a long access delay to their first level memory which can severely restrict the performance of superscalar processors. Compilers attempt to move load instructions far enough ahead to hide this latency. However, conventional movement of load instructions is limited by data dependence analysis. This paper introduces a simple hardware scheme, referred to as preload register update, to allow the compiler to move load instructions even in the presence of inconclusive data dependence analysis results. Preload register update keeps the load destination registers coherent when load instructions are moved past store instructions that reference the same location. With this addition, superscalar processors can more effectively tolerate longer data access latencies.


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
 
4
5
6
 
7
V. A. Guarna Jr., "Analysis of C programs for parallelization in the presence of pointers," Master's thesis, Center for Supercomputing Research and Development, University of Illinois, Urbana-Champaign, Illinois, 1987.
8
9
 
10
P. G. Emma, J. W. Knight, III, J. H. Pomerene, R. N. Rechtschaffen, and F. J. Sparacio, "Posting out-ofsequence fetches," Feb. 1991. United States Patent No. 4991090.
 
11
 
12
 
13
 
14
S. A. Mahlke, W. Y. Chen, W. W. Hwu, B. R. Rau, and M. S. Schlansker, "Sentinel scheduling for VLIW and superscalar processors," tech. rep., Center for Reliable and High-Performance Computing, University of illinois, Urbana, IL, Dec. 1991.
 
15
16
 
17
18


Collaborative Colleagues:
William Y. Chen: colleagues
Scott A. Mahlke: colleagues
Wen-mei W. Hwu: colleagues
Tokuzo Kiyohara: colleagues
Pohua P. Chang: colleagues

Peer to Peer - Readers of this Article have also read: