We describe the development of Metropolis Monte Carlo algorithms for a general network of multiple instruction multiple data (MIMD) parallel processors. The implementation of farm, event, and systolic parallel algorithms on transputer-based computers is detailed and their relative performance discus
Monte-Carlo parallelization algorithm
β Scribed by N. M. Ershov; A. M. Popov
- Publisher
- Springer
- Year
- 1996
- Tongue
- English
- Weight
- 327 KB
- Volume
- 7
- Category
- Article
- ISSN
- 1046-283X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A method for generating sequences of quasirandom numbers allows conventional serial Monte Carlo algorithms to be parallelized using a leapfrog scheme. Specifically, a Sobol' sequence can be broken up into interleaved subsets; with each processing node calculating a unique subset of the full sequence
I give a pedagogical introduction to the generalised Hybrid Monte Carlo and related algorithms. I shall explain why they work, how their performance depends upon the number of degrees of freedom and the correlation length, and how they can be tuned to reduce critical slowing down.
We show the use of the homogenous architecture in the parallel processing of long range interactions. We describe the implementation of a Monte Carlo algorithm for a two-dimensional Coulomb system on a parallel processor with hypercubic geometry (the 8-node concurrent processor at Caltech). Our res
KENO-Va is a code integrated within the SCALE system developed by Oak Ridge that solves the transport equation through the Monte Carlo Method. It is being used at the Consejo de Seguridad Nuclear (CSN) to perform criticality calculations for fuel storage pools and shipping casks. Two parallel versio