Compiler Optimizations for Fortran D on MIMD Distributed-Memory Machines (1991)
Download From
IEEE
Download Links
- [www.cs.umd.edu]
- [softlib.rice.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IN PROCEEDINGS OF THE 1992 ACM INTERNATIONAL CONFERENCE ON SUPERCOMPUTING |
| Citations: | 96 - 13 self |
BibTeX
@INPROCEEDINGS{Hiranandani91compileroptimizations,
author = {Seema Hiranandani and Ken Kennedy and Chau-Wen Tseng},
title = {Compiler Optimizations for Fortran D on MIMD Distributed-Memory Machines},
booktitle = {IN PROCEEDINGS OF THE 1992 ACM INTERNATIONAL CONFERENCE ON SUPERCOMPUTING},
year = {1991},
pages = {86--100},
publisher = {}
}
Years of Citing Articles
OpenURL
Abstract
Massively parallel MIMD distributed-memory machines can provide enormous computation power. However, the difficulty of developing parallel programs for these machines has limited their accessibility. This paper presents compiler algorithms to automatically derive efficient message-passing programs based on data decompositions. Optimizations are presented to minimize load imbalance and communication costs for both loosely synchronous and pipelined loops. These techniques are employed in the compiler being developed at Rice University for Fortran D, a version of Fortran enhanced with data decomposition specifications.







