Parallelization of adaptive MC integrators

From MaRDI portal

DOI10.1016/S0010-4655(97)00099-4zbMATH Open0937.65002arXivphysics/9710028OpenAlexW2962692205WikidataQ127677677 ScholiaQ127677677MaRDI QIDQ1967183FDOQ1967183


Authors: Richard Kreckel Edit this on Wikidata


Publication date: 13 March 2000

Published in: Computer Physics Communications (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/physics/9710028




Recommendations




Cites Work


Cited In (6)

Uses Software





This page was built for publication: Parallelization of adaptive MC integrators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1967183)