Abstract The fundamental requirements for the sequence of numbers produced by a random number generator in a computer program are that (1) the sequence be indistinguishable from that produced by an iid sequence of standard uniformly distributed random variables; (2) the sequence be identically reproduced on a subsequent execution of the same computer program. For computers with multiple processors it is sensible to add the additional requirement that (3) the sequences used by each of the several processors be indistinguishable from independent sequences. If one uses a standard random number generator developed for a uniprocessor in an environment with multiple processors, then each one of these requirements may be violated. This paper contains a review of previous attempts to satisfy the three requirements for a multiprocessor and concludes that none are really successful.
[1]
George Marsaglia,et al.
Uniform Random Number Generators
,
1965,
JACM.
[2]
Lee W. Schruben,et al.
Pseudorandom Number Assignment in Statistically Designed Simulation and Distribution Sampling Experiments
,
1978
.
[3]
K. O. Bowman,et al.
Studies of random number generators for parallel processing
,
1986
.
[4]
S. K. Park,et al.
Random number generators: good ones are hard to find
,
1988,
CACM.
[5]
Bruce Jay Collings,et al.
Compound Random Number Generators
,
1987
.
[6]
Burton J. Smith,et al.
Pseudo-random trees in Monte Carlo
,
1984,
Parallel Comput..