Parallel Implementation of a Lagrangian Stochastic Model for Pollutant Dispersion

Abstract

Lagrangian dispersion models have shown to be effective and reliable tools for simulating the airborne pollutant dispersion. However, the main drawback for their use as regulatory models is the associated high computational costs. Consequently, in this paper a parallel version of a Lagrangian particle model-LAMBDA-is developed using the MPI message passing communication library. Performance tests were executed in a distributed memory parallel machine, a multicomputer based on IA-32 architecture. Portions of the pollutant in the air emitted from its source are simulated as fictitious particles whose trajectories evolve under stochastic forcing. This yields independent evolution equations for each particle of the model that can be computed by a different processor in a parallel implementation. Speed-up results show that the parallel implementation is suitable for the used architecture.

Dispersion modeling of air pollutants in the atmosphere: a review

“…Any number of trajectories can be computed independently in parallel, and communication is required only to distribute tasks and gather results. Such a computation is called an embarrassingly parallel problem, and fits well to any parallel computing architecture, including grids [122,123], clusters of any size [124,125], and GPUs [107][108][109]. Most commonly, implementations follow the master-slave paradigm.…”

Parallel and distributed simulation of sediment dynamics in shallow water using particle decomposition approach

“…Using parallel processing it is possible to both significantly reduce the simulation time as well as to alleviate memory problems. As the particle tracks are inherently independent of one another it is natural to compute these in parallel (see [8,13]), for example). It is known that parallel particle computations themselves are quite trivial.…”

“…In [13], the parallel approach is based on particle decomposition (i.e., particles are uniformly distributed across the processors). This is because they want to avoid the need of dynamic load balancing with domain decomposition after each time step and when the number of processors is increased.…”

Solving stochastic earliness and tardiness parallel machine scheduling using Quantum Genetic Algorithm

“…Arnaout, et al addressed the problem of batch scheduling in an unrelated parallel machine environment, where dependent setup times are independent and the objective is to minimize the weighted mean completion time [3]. Meanwhile, a Lagrangian dispersion model is used in 2005 [4]. Pinedo et al investigated the effect of the variability of the processing times on the expected makespan [5].…”