We describe a new approach to programming distributed-memory computers. Rather than having each node in the system explicitly programmed, we derive an efficient message-passing program from a sequential shared-memory program annotated with directions on how elements of shared arrays are distributed to processors. This article describes one possible input language for describing distributions and then details the compilation process and the optimization necessary to generate an efficient program. © 1988 Kluwer Academic Publishers.
CITATION STYLE
Callahan, D., & Kennedy, K. (1988). Compiling programs for distributed-memory multiprocessors. The Journal of Supercomputing, 2(2), 151–169. https://doi.org/10.1007/BF00128175
Mendeley helps you to discover research relevant for your work.