Dependence Based Prefetching for Linked Data Structures

DMCA

Dependence Based Prefetching for Linked Data Structures (1998)

Cached

Download Links

by Amir Roth , Andreas Moshovos , Gurindar S. Soh

Citations:

179 - 13 self

BibTeX

@INPROCEEDINGS{Roth98dependencebased,
    author = {Amir Roth and Andreas Moshovos and Gurindar S. Soh},
    title = {Dependence Based Prefetching for Linked Data Structures},
    booktitle = {},
    year = {1998},
    pages = {115--126}
}

OpenURL

Abstract

We introduce a dynamic scheme that captures the access patterns 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 identifying producer-consumer pairs, we construct a compact internal representation for the associated structure and its traversal. To achieve a prefetching effect, 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. 1 Introduction Linked data structures (LDS) such as lists and trees are used in many important applications. The importance of LDS is growing with the increasing popularity of C++, Java, and other systems that use linked object graphs and function tables. Flexible, dynamic construction allows linked structures to grow large and diffic...

Keyphrases

linked data structure data structure access pattern dynamic scheme many important application object graph dynamic construction achieves speedup small prefetch engine pointer-intensive program dependence relationship compact internal representation prefetching effect high accuracy associated structure function table future access producer-consumer pair

DMCA