Experiments With Elliptic Problem Solvers On The Cedar Multicluster

. The implementation and performance of algorithms for the solution of elliptic problems on the Cedar multiprocessor is examined. The algorithms considered are conjugate gradient schemes with or without preconditioning on a rectangular domain and domain decomposition techniques with overlapping (Schwarz Alternating Method) and nonoverlapping subdomains on a T-shaped domain. We present some preliminary results from our current research effort. 1. Introduction. We have presented elsewhere ([1, 2]) algorithms for solving elliptic PDEs on vector multiprocessors under a memory hierarchy, which in essence consisted of a single cluster of the Cedar architecture designed at CSRD. The major algorithmic design issues in those discussions have been centered around the exploitation of the memory hierarchy and the effective combination of vector and concurrent processing. We are currently modifying and testing algorithms for the Cedar multicluster. In this paper we will provide a brief outline of ..