Logo image
Back
Testing parallel random number generators
Journal article   Peer reviewed

Testing parallel random number generators

Ashok Srinivasan, Michael Mascagni and David Ceperley
Parallel Computing, Vol.29, pp.69-94
29
2003
DOI: https://doi.org/10.1016/S0167-8191(02)00163-1
Web of Science ID: WOS:000180964100004

Metrics

36 Record Views
67 Times Cited - Web of Science

Abstract

Monte Carlo computations are considered easy to parallelize. However, the results can be adversely affected by defects in the parallel pseudorandom number generator used. A parallel pseudorandom number generator must be tested for two types of correlations––(i) intrastream correlation, as for any sequential generator, and (ii) inter-stream correlation for correlations between random number streams on different processes. Since bounds on these correlations are difficult to prove mathematically, large and thorough empirical tests are necessary. Many of the popular pseudorandom number generators in use today were tested when computational power was much lower, and hence they were evaluated with much smaller test sizes. This paper describes several tests of pseudorandom number generators, both statistical and application-based. We show defects in several popular generators. We describe the implementation of these tests in the SPRNG [ACM Trans. Math. Software 26 (2000) 436; SPRNG––scalable parallel random number generators. SPRNG 1.0––http://www.ncsa.uiuc.edu/Apps/SPRNG; SPRNG 2.0––http://sprng.cs.fsu.edu] test suite and also present results for the tests conducted on the SPRNG generators. These generators have passed some of the largest empirical random number tests.

Details

Logo image