𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Testing parallel random number generators

✍ Scribed by Ashok Srinivasan; Michael Mascagni; David Ceperley


Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
228 KB
Volume
29
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

✦ Synopsis


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.


πŸ“œ SIMILAR VOLUMES


Random-number generators
✍ Alan B. Forsythe πŸ“‚ Article πŸ“… 1968 πŸ› Elsevier Science 🌐 English βš– 217 KB

A commonly used uniform random-number generator is examined in light of a genetic-simulation problem. Although this generator is often useful, it proves defective in this case. The author suggests that any proposed generator be checked for the properties needed by the simulation problem at hand.

Portable random number generators
✍ Gerald P. Dwyer Jr.; K.B. Williams πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 67 KB

We present a random number generator that is useful for serious computations and can be implemented easily in any language that has 32-bit signed integers, for example C, C ++ and FORTRAN. This combination generator has a cycle length that would take two millennia to compute on widely used desktop c

Biometric random number generators
✍ J. Szczepanski; E. Wajnryb; J.M. AmigΓ³; Maria V. Sanchez-Vives; M. Slater πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 169 KB

Up to now biometric methods have been used in cryptography for authentication purposes. In this paper we propose to use biological data for generating sequences of random bits. We point out that this new approach could be particularly useful to generate seeds for pseudo-random number generators and