Combining flow and dependence analyses to expose redundant array accesses |
| |
Authors: | Elana D Granston Alexander V Veidenbaum |
| |
Affiliation: | (1) Center for Research on Parallel Computation, Rice University, 6100 S. Main Street, 77005 Houston, Texas;(2) Department of Electrical Engineering and Computer Science, (M/C 154), University of Illinois-Chicago, 1120 SEO, 851 S. Morgan Street, 60607-7053 Chicago, Illinois |
| |
Abstract: | 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. |
| |
Keywords: | Redundancy detection communication analysis flow analysis of parallel programs dependence analysis and data reuse |
本文献已被 SpringerLink 等数据库收录! |
|