BENCHMARKING PERFORMANCE OF PARALLEL COMPUTERS USING A 2D ELLIPTIC SOLVER

It was recently shown that block-circulant preconditioners applied to a conjugate gradient method used to solve structured sparse linear systems arising from 2D elliptic problems have very good numerical properties and a potential for good parallel efficiency. The aim of the presentation is to summarize and compare their parallel performance across a number of modern parallel computers: SGI Power Challenge 10000, SGI/Cray Origin 2000, HP-Convex SPP-2000, IBM SP-2, Cray T3E, a network of SUN workstations and a Beowulf cluster of PC’s.