Program analysis for cache coherence: Beyond procedural boundaries

L. Choi, Pen-Chung Yew

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

2 Scopus citations


The presence of procedures and procedure calls introduces side effects, which complicates the analysis of stale reference detection in compiler-directed cache coherence schemes. Previous compiler algorithms use cache invalidation at procedure boundary or inlining to avoid reference marking interprocedurally. We introduce a full interprocedural algorithm, which performs bottom-up and top-down analysis on the procedure call graph. This avoids unnecessary cache misses for subroutine local data and exploits locality across procedure boundaries. The result of execution-driven simulations on Perfect benchmarks demonstrates that, the interprocedural algorithm eliminates up to 36.8% of the cache misses for a compiler-directed scheme compared to an existing invalidation-based algorithm.

Original languageEnglish (US)
Title of host publicationSoftware
EditorsK. Pingali
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages11
ISBN (Electronic)081867623X
StatePublished - Jan 1 1996
Event25th International Conference on Parallel Processing, ICPP 1996 - Ithaca, United States
Duration: Aug 12 1996Aug 16 1996

Publication series

NameProceedings of the International Conference on Parallel Processing
ISSN (Print)0190-3918


Other25th International Conference on Parallel Processing, ICPP 1996
CountryUnited States

Fingerprint Dive into the research topics of 'Program analysis for cache coherence: Beyond procedural boundaries'. Together they form a unique fingerprint.

Cite this