Dependence based prefetching for linked data structures

  • Authors:

  • Amir Roth;Andreas Moshovos;Gurindar S. Sohi

  • Affiliations:

  • Computer Sciences Department, University of Wisconsin, Madison, 1210 W. Dayton St., Madison, WI;Computer Sciences Department, University of Wisconsin, Madison, 1210 W. Dayton St., Madison, WI;Computer Sciences Department, University of Wisconsin, Madison, 1210 W. Dayton St., Madison, WI

  • Venue:
  • Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
  • Year:
  • 1998

Quantified Score

Hi-index 0.01

Visualization

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.