Parallelization of adaptive MC integrators. Monte Carlo (MC) methods for numerical integration seem to be embarrassingly parallel on first sight. When adaptive schemes are applied in order to enhance convergence however, the seemingly most natural way of replicating the whole job on each processor can potentially ruin the adaptive behaviour. Using the popular VEGAS-algorithm as an example an economic method of semi-micro parallelization with variable grain-size is presented and contrasted with another straightforward approach of macro-parallelization. A portable implementation of this semi-micro parallelization is used in the xloops-project and is made publicly available.
Keywords for this software
References in zbMATH (referenced in 4 articles , 1 standard article )
Showing results 1 to 4 of 4.
- Adzhemyan, L.Ts.; Kompaniets, M.V.: Renormalization group and the $\varepsilon$-expansion: representation of the $\beta$-function and anomalous dimensions by nonsingular integrals (2011)
- Corcoran, J.N.; Schneider, U.; Schüttler, H.-B.: Perfect stochastic summation in high order Feynman graph expansions (2006)
- Kharraziha, Hamid; Moretti, Stefano: The Metropolis algorithm for on-shell four-momentum phase space (2001)
- Kreckel, Richard: Parallelization of adaptive MC integrators (1997)