## Interprocedural Compilation of Fortran D for MIMD Distributed-Memory Machines (1992)

### Cached

### Download Links

- [www.cs.umd.edu]
- [www.cs.umd.edu]
- [www.cs.umd.edu]
- [softlib.rice.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | COMMUNICATIONS OF THE ACM |

Citations: | 309 - 46 self |

### BibTeX

@ARTICLE{Hall92interproceduralcompilation,

author = {Mary W. Hall and Seema Hiranandani and Ken Kennedy and Chau-Wen Tseng},

title = {Interprocedural Compilation of Fortran D for MIMD Distributed-Memory Machines},

journal = {COMMUNICATIONS OF THE ACM},

year = {1992},

volume = {35},

pages = {66--80}

}

### Years of Citing Articles

### OpenURL

### Abstract

Algorithms exist for compiling Fortran D for MIMD distributed-memory machines, but are significantly restricted in the presence of procedure calls. This paper presents interprocedural analysis, optimization, and code generation algorithms for Fortran D that limit compilation to only one pass over each procedure. This is accomplished by collecting summary information after edits, then compiling procedures in reverse topological order to propagate necessary information. Delaying instantiation of the computation partition, communication, and dynamic data decomposition is key to enabling interprocedural optimization. Recompilation analysis preserves the benefits of separate compilation. Empirical results show that interprocedural optimization is crucial in achieving acceptable performance for a common application.