BENCHMARKING OF MIMD HARDWARE ON SUBDOMAIN SPLITTING ELLIPTIC PDE SOLVERS

In this paper we model and evaluate the performance of a number of parallel machines that are commercially available over a subdomain splitting method (SPM) for solving elliptic partial differential equations (PDEs). The basic idea of this method is [0 subdivide the domain of the PDE problem into a number of overlapping subdomains and decompose the problem into one that involves solution of PDE boundary value problems on the subdomains. The interaction among subdomains is implemented according to Jacobi and Gauss-Seidel iterative schemes. For the bus architecrures we use the loop-based approach to specify the inherent parallelism and the Argonne SCHEDULE package to implement it For the local memory machines. we use block and substracruring data srructures for the implementation of SPM and we map the underlying computation onto a 2-dimensional grid. Preliminary results indicate that both the shared and non~shared memory machines behave equally well for the various configurations. 1