Abstract
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 language | English |
|---|---|
| Title of host publication | Software |
| Editors | K. Pingali |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 103-113 |
| Number of pages | 11 |
| Volume | 3 |
| ISBN (Electronic) | 081867623X |
| DOIs | |
| Publication status | Published - 1996 Jan 1 |
| Externally published | Yes |
| Event | 25th International Conference on Parallel Processing, ICPP 1996 - Ithaca, United States Duration: 1996 Aug 12 → 1996 Aug 16 |
Other
| Other | 25th International Conference on Parallel Processing, ICPP 1996 |
|---|---|
| Country | United States |
| City | Ithaca |
| Period | 96/8/12 → 96/8/16 |
Fingerprint
ASJC Scopus subject areas
- Software
- Mathematics(all)
- Hardware and Architecture
Cite this
Program analysis for cache coherence : Beyond procedural boundaries. / Choi, Lynn; Yew, Pen Chung.
Software. ed. / K. Pingali. Vol. 3 Institute of Electrical and Electronics Engineers Inc., 1996. p. 103-113 538565.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Program analysis for cache coherence
T2 - Beyond procedural boundaries
AU - Choi, Lynn
AU - Yew, Pen Chung
PY - 1996/1/1
Y1 - 1996/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=33749929170&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33749929170&partnerID=8YFLogxK
U2 - 10.1109/ICPP.1996.538565
DO - 10.1109/ICPP.1996.538565
M3 - Conference contribution
AN - SCOPUS:33749929170
VL - 3
SP - 103
EP - 113
BT - Software
A2 - Pingali, K.
PB - Institute of Electrical and Electronics Engineers Inc.
ER -