New Scalability and Accuracy Results for a Latency-Tolerant Elliptic Solver

Scott B. Baden, Phillip Colella, Gregory T. Balls, Peter McCorquodale

Abstract

We present new scalability and accuracy results for a second-order accurate elliptic free space solver. Employing a method of local corrections, we reduce communication costs by representing far-field effects at a coarser resolution. Improvements in parallel scalability for the global coarse calculation and the introduction of adaptivity allow us to scale efficiently to thousands of processors. Numerical overheads incurred are independent of the number of processors for a wide range of problem sizes.