Eliminating stale data references through array data-flow analysis

Lynn Choi, Pen Chung Yew

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

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
Title of host publicationIEEE Symposium on Parallel and Distributed Processing - Proceedings
PublisherIEEE
Pages4-13
Number of pages10
Publication statusPublished - 1996
Externally publishedYes
EventProceedings of the 1996 10th International Parallel Processing Symposium - Honolulu, HI, USA
Duration: 1996 Apr 151996 Apr 19

Other

OtherProceedings of the 1996 10th International Parallel Processing Symposium
CityHonolulu, HI, USA
Period96/4/1596/4/19

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Choi, L., & Yew, P. C. (1996). Eliminating stale data references through array data-flow analysis. In IEEE Symposium on Parallel and Distributed Processing - Proceedings (pp. 4-13). IEEE.