Range Decomposition: A Low Communication Algorithm for Solving PDEs on Massively Parallel Machines

By Tom Manteuffel

University of Colorado

Published on

Abstract

The Range Decomposition (RD) algorithm uses nested iteration and adaptive mesh refinement locally before performing a global communication step. Only several such steps are observed to be necessary before reaching a solution within a small multiple of discretization error. The target application is peta- and exascale machines where traditional parallel numerical PDE communication patterns stifle scalability. The RD algorithm uses a partition of unity to equally distribute the error, and thus, the work. The computational advantages of this approach are that the decomposed problems can be solved using nested iteration and any multigrid cycle type, in parallel, without any communication until the partitioned solutions are summed. This offers potential advantages in the paradigm of expensive communication but very cheap computation. Performance models and numerical results demonstrate the enhanced performance.

Cite this work

Researchers should cite this work as follows:

  • Tom Manteuffel (2016), "Range Decomposition: A Low Communication Algorithm for Solving PDEs on Massively Parallel Machines," http://nanohub.org/resources/23540.

    BibTex | EndNote

Submitter

NanoBio Node, Aly Taha

University of Illinois at Urbana-Champaign

Tags