The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—Data parallel languages, like High Performance Fortran (HPF), support the notion of distributed arrays. However, the implementation of such distributed array structures and their access on message passing computers is not straightforward. This holds especially for distributed arrays that are aligned to each other and given a block-cyclic distribution.</p><p>In this paper, an implementation framework is presented for HPF distributed arrays on message passing computers. Methods are presented for efficient (in space and time) local index enumeration, local storage, and communication.</p><p>Techniques for local set enumeration provide the basis for constructing local iteration sets and communication sets. It is shown that both local set enumeration and local storage schemes can be derived from the same equation. Local set enumeration and local storage schemes are shown to be orthogonal, i.e., they can be freely combined. Moreover, for linear access sequences generated by our enumeration methods, the local address calculations can be moved out of the enumeration loop, yielding efficient local memory address generation.</p><p>The local set enumeration methods are implemented by using a relatively simple general transformation rule for absorbing ownership tests. This transformation rule can be repeatedly applied to absorb multiple ownership tests. Performance figures are presented for local iteration overhead, a simple communication pattern, and storage efficiency.</p>
HPF, message passing, message aggregation, distributed arrays, parallel computers.

K. v. Reeuwijk, E. M. Paalvast, H. J. Sips and W. Denissen, "An Implementation Framework for HPF Distributed Arrays on Message-Passing Parallel Computer Systems," in IEEE Transactions on Parallel & Distributed Systems, vol. 7, no. , pp. 897-914, 1996.
92 ms
(Ver 3.3 (11022016))