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 (US) |
|---|---|
| Title of host publication | Software |
| Editors | K. Pingali |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 103-113 |
| Number of pages | 11 |
| ISBN (Electronic) | 081867623X |
| DOIs | |
| State | Published - 1996 |
| Event | 25th International Conference on Parallel Processing, ICPP 1996 - Ithaca, United States Duration: Aug 12 1996 → Aug 16 1996 |
Publication series
| Name | Proceedings of the International Conference on Parallel Processing |
|---|---|
| Volume | 3 |
| ISSN (Print) | 0190-3918 |
Other
| Other | 25th International Conference on Parallel Processing, ICPP 1996 |
|---|---|
| Country/Territory | United States |
| City | Ithaca |
| Period | 8/12/96 → 8/16/96 |
Bibliographical note
Publisher Copyright:© 1996 IEEE.
Fingerprint
Dive into the research topics of 'Program analysis for cache coherence: Beyond procedural boundaries'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS