Geometrically Parallel Algorithms

Abstract

A natural way to implement the simulation on a parallel computer of any system that involves a regular geometry and spatially limited interactions is to divide the volume into equally sized portions, each of which are then assigned to one of the parallel processing elements. This geometric parallelism, sometimes referred to as domain decomposition, can be implemented in a variety of ways, of which we present here some of the principle ones. The expression data parallelism is sometimes used in the literature to describe these types of algorithms, but we feel that the expression geometric parallelization describes more unambiguously the partitioning of the actual space in which the simulation ..