On parallelizing a groundwater pollution simulator
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.
- scientific article; zbMATH DE number 417773 (Why is no real title available?)
- scientific article; zbMATH DE number 665529 (Why is no real title available?)
- scientific article; zbMATH DE number 848146 (Why is no real title available?)
- Ordering Schemes for Parallel Processing of Certain Mesh Problems
- Reordering computations for parallel execution
This page was built for publication: On parallelizing a groundwater pollution simulator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126658)