ACM Home Page
Please provide us with feedback. Feedback
Tolerating late memory traps in ILP processors
Full text PdfPdf (100 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: 76 - 87  
Year of Publication: 1999
ISBN:0-7695-0170-2
Also published in ...
Authors
Xiaogang Qiu  Department of Electrical Engineering - Systems, University of Southern California, Los Angeles, CA
Michel Dubois  Department of Electrical Engineering - Systems, University of Southern California, Los Angeles, CA
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): 8,   Downloads (12 Months): 26,   Citation Count: 7
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.300986
What is a DOI?

ABSTRACT

ILP processors can execute a large number of instructions at the same time. Thus it becomes more and more difficult to support traps efficiently. On the other hand a current trend in architecture is to support various memory functions in software rather than hardware, usually by trapping the execution processor on a cache miss, TLB miss or a failed access to a local or remote memory. These late memory traps block the faulting instruction at the top of the active list, backing up the pipeline. Moreover the support for late memory traps may affect the performance of non-faulting memory instructions as well.In this paper we analyze the overhead caused by late memory traps in ILP processors and define several measures for this overhead. In order to tolerate late memory traps, we propose hardware prefetching of exception conditions and a tagged Store buffer to implement deferred traps on Stores. We show that, with these hardware optimizations, the overhead added by the lateness of traps is significantly reduced relative to the overhead of early traps. Because of caching effects the frequency of late memory traps usually decreases as they are taken deeper in the memory hierarchy and their overall impact on the execution time becomes negligible.


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
8
 
9
Kourosh Gharachorloo, Anoop Gupta, and John Hennessy, "Two Techniques to Enhance the Performance of Memory Consistency Models", In Proceedings of the International Conference on Parallel Processing, pages 1355-1364, 1991
10
11
12
 
13
14
 
15
16
 
17
Vijay Pai, Parthasarathy Ranganathan, Sarita Adve, "RSIM Reference Manual", Technical Report 9705, Department of Electrical and Computer Engineering, Rice University, Aug, 1997
18
19
20
21
22
 
23
Yong Ho Song and Michel Dubois,"Assisted Execution", Technical Report #CENG 98-25, Department of EE-Systems, University of Southern California, October 1998.
24
25
 
26
Patricia Teller, and Allan Gottlieb. "Locating Multiprocessor TLBs at Memory," In Proceedings of the 27th Annual Hawaii International Conference on System Science, pages 554-563, 1994.
 
27
David Weaver and Tom Germond, "The SPARC Architecture Manual", version 9, Prentice Hall, t994.
28
 
29
30


Collaborative Colleagues:
Xiaogang Qiu: colleagues
Michel Dubois: colleagues