The Community for Technology Leaders
SC Conference (1992)
Minneapolis, MN, USA
Nov. 16, 1992 to Nov. 20, 1992
ISBN: 0-8186-2630-5
pp: 522-534
Hall , Stanford Univ., CA, USA
ABSTRACT
Algorithms exist for compiling Fortran D for MIMD (multiple-instruction multiple-data) distributed-memory machines, but they are significantly restricted in the presence of procedure calls. The authors present 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, and 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.
INDEX TERMS
interprocedural compilation, Fortran D, MIMD distributed-memory machines, procedure calls, optimization, code generation algorithms, computation partition, dynamic data decomposition
CITATION

Hiranandani, Hall, Tseng and Kennedy, "Interprocedural compilation of Fortran D for MIMD distributed-memory machines," SC Conference(SC), Minneapolis, MN, USA, 1992, pp. 522-534.
doi:10.1109/SUPERC.1992.236652
85 ms
(Ver 3.3 (11022016))