524 research outputs found
Pseudo-random number generators for Monte Carlo simulations on Graphics Processing Units
Basic uniform pseudo-random number generators are implemented on ATI Graphics
Processing Units (GPU). The performance results of the realized generators
(multiplicative linear congruential (GGL), XOR-shift (XOR128), RANECU, RANMAR,
RANLUX and Mersenne Twister (MT19937)) on CPU and GPU are discussed. The
obtained speed-up factor is hundreds of times in comparison with CPU. RANLUX
generator is found to be the most appropriate for using on GPU in Monte Carlo
simulations. The brief review of the pseudo-random number generators used in
modern software packages for Monte Carlo simulations in high-energy physics is
present.Comment: 31 pages, 9 figures, 3 table
Cluster Hybrid Monte Carlo Simulation Algorithms
We show that addition of Metropolis single spin-flips to the Wolff cluster
flipping Monte Carlo procedure leads to a dramatic {\bf increase} in
performance for the spin-1/2 Ising model. We also show that adding Wolff
cluster flipping to the Metropolis or heat bath algorithms in systems where
just cluster flipping is not immediately obvious (such as the spin-3/2 Ising
model) can substantially {\bf reduce} the statistical errors of the
simulations. A further advantage of these methods is that systematic errors
introduced by the use of imperfect random number generation may be largely
healed by hybridizing single spin-flips with cluster flipping.Comment: 16 pages, 10 figure
Hurst's Rescaled Range Statistical Analysis for Pseudorandom Number Generators used in Physical Simulations
The rescaled range statistical analysis (R/S) is proposed as a new method to
detect correlations in pseudorandom number generators used in Monte Carlo
simulations. In an extensive test it is demonstrated that the RS analysis
provides a very sensitive method to reveal hidden long run and short run
correlations. Several widely used and also some recently proposed pseudorandom
number generators are subjected to this test. In many generators correlations
are detected and quantified.Comment: 12 pages, 12 figures, 6 tables. Replaces previous version to correct
citation [19
Parallelization of adaptive MC Integrators
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.Comment: 10 pages, LaTeX2e, 1 pstricks-figure included and 2 eps-figures
inserted via epsfig. To appear in Comput. Phys. Commu
Portable random number generators
Computers are deterministic devices, and a computer-generated random number is a contradiction in terms. As a result, computer-generated pseudorandom numbers are fraught with peril for the unwary. We summarize much that is known about the most well-known pseudorandom number generators: congruential generators. We also provide machine-independent programs to implement the generators in any language that has 32-bit signed integers-for example C, C++, and FORTRAN. Based on an extensive search, we provide parameter values better than those previously available.Programming (Mathematics) ; Computers
Pseudorandom number generation on supercomputers
Random Walks;Supercomputer;computer science
Periodic orbits of the ensemble of Sinai-Arnold cat maps and pseudorandom number generation
We propose methods for constructing high-quality pseudorandom number
generators (RNGs) based on an ensemble of hyperbolic automorphisms of the unit
two-dimensional torus (Sinai-Arnold map or cat map) while keeping a part of the
information hidden. The single cat map provides the random properties expected
from a good RNG and is hence an appropriate building block for an RNG, although
unnecessary correlations are always present in practice. We show that
introducing hidden variables and introducing rotation in the RNG output,
accompanied with the proper initialization, dramatically suppress these
correlations. We analyze the mechanisms of the single-cat-map correlations
analytically and show how to diminish them. We generalize the Percival-Vivaldi
theory in the case of the ensemble of maps, find the period of the proposed RNG
analytically, and also analyze its properties. We present efficient practical
realizations for the RNGs and check our predictions numerically. We also test
our RNGs using the known stringent batteries of statistical tests and find that
the statistical properties of our best generators are not worse than those of
other best modern generators.Comment: 18 pages, 3 figures, 9 table
- âŠ