On parallelizing a groundwater pollution simulator (Q1126658)

We discuss domain decomposition strategies and computational mesh reordering for finite difference parallel simulations of groundwater contaminants transport. The parallel performance of point iterative methods traditionally used in groundwater pollution modelling is studied. The algorithms are implemented with red-black and wavefront reordering of the computational mesh. For the analysis we use a standard conservative transport equation defined on a two-dimensional grid with Dirichlet boundary conditions. Completely portable multiple instruction multiple data (MIMD) implementations of the algorithm are performed using message-passing interface. The runtimes of the algorithms are presented as a function of grid refinement and number of processors, and the communication overhead of the parallel simulation process is investigated, showing that the red-black reordering technique yields the best performance results.