Random numbers for large-scale distributed Monte Carlo simulations
- 6 June 2007
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 75 (6) , 066701
Abstract
Monte Carlo simulations are one of the major tools in statistical physics, complex system science, and other fields, and an increasing number of these simulations is run on distributed systems like clusters or grids. This raises the issue of generating random numbers in a parallel, distributed environment. In this contribution we demonstrate that multiple linear recurrences in finite fields are an ideal method to produce high quality pseudorandom numbers in sequential and parallel algorithms. Their known weakness (failure of sampling points in high dimensions) can be overcome by an appropriate delinearization that preserves all desirable properties of the underlying linear sequence.Keywords
All Related Versions
This publication has 37 references indexed in Scilit:
- Randomness as a ResourceAmerican Scientist, 2001
- Strong deviations from randomness in m -sequences based on trinomialsACM Transactions on Modeling and Computer Simulation, 1996
- A portable high-quality random number generator for lattice field theory simulationsComputer Physics Communications, 1994
- On the Use of Reducible Polynomials as Random Number GeneratorsMathematics of Computation, 1993
- Definitions of randomnessAmerican Journal of Physics, 1991
- The hierarchy of correlations in random binary sequencesJournal of Statistical Physics, 1991
- Random numbers for simulationCommunications of the ACM, 1990
- A remark on long-range correlations in multiplicative congruential pseudo random number generatorsNumerische Mathematik, 1989
- Coding the Lehmer pseudo-random number generatorCommunications of the ACM, 1969
- Shift-register synthesis and BCH decodingIEEE Transactions on Information Theory, 1969