Eliminating stale data references through array data-flow analysis

Lynn Choi, Pen Chung Yew

Research output: Contribution to journalConference articlepeer-review

3 Scopus citations


In this paper, we develop a compiler algorithm for detecting references to stale data in shared-memory multiprocessors. The algorithm consists of two key analysis techniques, stale reference detection and locality preserving analysis. While the stale reference detection finds the memory reference patterns that may violate cache coherence, the locality preserving analysis minimizes the number of such stale references by analyzing both temporal and spatial reuses. By computing the regions referenced by arrays inside loops, we extend the previous scalar algorithms [7, 9] for more precise analysis. We have implemented the algorithm on the Polaris parallelizing compiler [19], and using execution-driven simulations on Perfect Club benchmarks we demonstrate how unnecessary cache misses can be eliminated by the automatic stale reference detection.

Original languageEnglish (US)
Pages (from-to)4-13
Number of pages10
JournalIEEE Symposium on Parallel and Distributed Processing - Proceedings
StatePublished - Jan 1 1996
EventProceedings of the 1996 10th International Parallel Processing Symposium - Honolulu, HI, USA
Duration: Apr 15 1996Apr 19 1996


Dive into the research topics of 'Eliminating stale data references through array data-flow analysis'. Together they form a unique fingerprint.

Cite this