Combining flow and dependence analyses to expose redundant array accesses
International Journal of Parallel Programming(1995)
摘要
The success of large-scale, hierarchical and distributed shared memory systems hinges on our ability to reduce delays resulting
from remote accesses to shared data. To facilitate this, we present a compile-time algorithm for analyzing programs with doall-style
parallelism to determine when read and write accesses to shared data areredundant (unnecessary). One identified, redundant remote accesses can be replaced by local accesses or eliminated entirely. This optimization
improves program performance in two ways. First, slow memory accesses are replaced by faster ones. Second, the time to perform
other remote memory accesses may be reduced as a result of the decreased traffic level. We also show how the information obtained
through redundancy analysis can be used for other compiler optimizations such as prefetching and cache management.
更多查看译文
关键词
redundant array access,dependence analysis,combining flow,flow analysis of parallel programs,and data reuse.,communication analysis,redundancy detection,distributed shared memory,compiler optimization,flow analysis
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要