ACM Home Page
Please provide us with feedback. Feedback
Dependence based prefetching for linked data structures
Full text PdfPdf (1.81 MB)
Source Architectural Support for Programming Languages and Operating Systems archive
Proceedings of the eighth international conference on Architectural support for programming languages and operating systems table of contents
San Jose, California, United States
Pages: 115 - 126  
Year of Publication: 1998
ISBN:1-58113-107-0
Also published in ...
Authors
Amir Roth  Computer Sciences Department, University of Wisconsin, Madison, 1210 W. Dayton St., Madison, WI
Andreas Moshovos  Computer Sciences Department, University of Wisconsin, Madison, 1210 W. Dayton St., Madison, WI
Gurindar S. Sohi  Computer Sciences Department, University of Wisconsin, Madison, 1210 W. Dayton St., Madison, WI
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
IEEE-CS : Computer Society
SIGARCH: ACM Special Interest Group on Computer Architecture
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 82,   Citation Count: 64
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

We introduce a dynamic scheme that captures the accesspat-terns of linked data structures and can be used to predict future accesses with high accuracy. Our technique exploits the dependence relationships that exist between loads that produce addresses and loads that consume these addresses. By identzj+ing producer-consumer pairs, we construct a compact internal representation for the associated structure and its traversal. To achieve a prefetching eflect, a small prefetch engine speculatively traverses this representation ahead of the executing program. Dependence-based prefetching achieves speedups of up to 25% on a suite of pointer-intensive programs.


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
D. Burger, T. Austin, and S. Bennett. Evaluating future microprocessors: The simplescalar toolset. Technical Report CS-TR-96-1308, University of Wisconsin-Madison, Jul. 1996.
3
 
4
 
5
T. Chilimbi, J. Larus, and M. Hill. Improving pointer-based codes through cache-concious data placement. Technical Report CS-TR-98-1365, University of Wisconsin, Madison, Mar. 1998.
6
7
8
9
10
 
11
12
13
14
15
 
16
17
18
 
19
20
21
22
 
23

CITED BY  64

Collaborative Colleagues:
Amir Roth: colleagues
Andreas Moshovos: colleagues
Gurindar S. Sohi: colleagues