Parallel Array Classes and Lightweight Sharing Mechanisms

Issue title: The First Annual Object-Oriented Numerics Conference (OON-SKI '93)

Article type: Research Article

Authors: OTTO, STEVE W.

Affiliations: Department of Computer Science and Engineering, Oregon Graduate Institute of Science and Technology, Beaverton, OR 97006-1999

Abstract: We discuss a set of parallel array classes, MetaMP, for distributed-memory architectures. The classes are implemented in C++ and interface to the PVM or Intel NX message-passing systems. An array class implements a partitioned array as a set of objects distributed across the nodes – a "collective" object. Object methods hide the low-level message-passing and implement meaningful array operations. These include transparent guard strips (or sharing regions) that support finite-difference stencils, reductions and multibroadcasts for support of pivoting and row operations, and interpolation/contraction operations for support of multigrid algorithms. The concept of guard strips is generalized to an object implementation of lightweight sharing mechanisms for finite element method (FEM) and particle-in-cell (PIC) algorithms. The sharing is accomplished through the mechanism of weak memory coherence and can be efficiently implemented. The price of the efficient implementation is memory usage and the need to explicitly specify the coherence operations. An intriguing feature of this programming model is that it maps well to both distributed-memory and shared-memory architectures.

Journal: Scientific Programming, vol. 2, no. 4, pp. 203-216, 1993