Parallelization of adaptive MC Integrators

Abstract

Monte Carlo (MC) methods for numerical integration seem to be embarassingly 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.

10 pages, LaTeX2e, 1 pstricks-figure included and 2 eps-figures inserted via epsfig. To appear in Comput. Phys. Commun

References in corpus (1)

• XLOOPS -- A Program Package calculating One- and Two-Loop Feynman Diagrams

Cited by in corpus (12)

• Automatic Computation of Feynman Diagrams
• Virtual meson cloud of the nucleon and generalized parton distributions
• Electroweak structure of the nucleon, meson cloud and light-cone wavefunctions
• Next-to-next-to-leading-order QCD corrections to hadronic width of pseudoscalar quarkonium
• ZMCintegral: a Package for Multi-Dimensional Monte Carlo Integration on Multi-GPUs
• Parallel Adaptive Monte Carlo Integration with the Event Generator WHIZARD
• Path-integral calculation of the fourth virial coefficient of helium isotopes
• Path-integral calculation of the third dielectric virial coefficient of noble gases
• Study of perturbative QCD predictions at next-to-leading order and beyond for \pp -> H -> gamma gamma + X
• ZMCintegral-v5: Support for Integrations with the Scanning of Large Parameter Grids on Multi-GPUs
• Distinguishing WH and WBBbar production at the Fermilab Tevatron
• Numerical calculation of scaling exponents of percolation process in the framework of renormalization group approach