go-v.orgdoi

Increasing and detecting memory address congruence

Samuel Larsen, Emmett Witchel, Saman P. Amarasinghe · DSpace@MIT (Massachusetts Institute of Technology) · 2002

  • DOI 10.5555/645989.674329
  • Publisher Massachusetts Institute of Technology
  • Type article
  • Issued 2002

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

DSpace@MIT (Massachusetts Institute of Technology) · Massachusetts Institute of Technology · article · 2002

Abstract

A static memory reference exhibits a unique property when its dynamic memory addresses are congruent with respect to some non-trivial modulus. Extraction of this congruence information at compile-time enables new classes of program optimization. In this paper, we present methods for forcing congruence among the dynamic addresses of a memory reference. We also introduce a compiler algorithm for detecting this property. Our transformations do not require interprocedural analysis and introduce almost no overhead. As a result, they can be incorporated into real compilation systems.

On average, our transformations are able to achieve a five-fold increase in the number of congruent memory operations. We are then able to detect 95% of these references. This success is invaluable in providing performance gains in a variety of areas. When congruence information is incorporated into a vectorizing compiler, we can increase the performance of a G4 AltiVec processor up to a factor of two. Using the same methods, we are able to reduce energy consumption in a data cache by as much as 35%.

Open the resolved locator · 10.5555/645989.674329

Metadata licence: OpenAlex metadata (CC0)

Registry
OpenAlex DOI index + API
Fetched
2026-11-20 03:34 UTC
Cache state
not cached yet (bulk-index+openalex)
Locator
http://hdl.handle.net/1721.1/3760
Metadata licence
OpenAlex metadata (CC0)
Scope
Metadata as returned by the resolver; abstracts are never generated here.