Random Number Generators for Parallel Computers
| <- HREF="node17.html" Prev | Index | Next -> |
NHSE ReviewTM: Comments
· Archive
· Search
The cellular automata generator [58]
is a generalization of the shift register generator, based on cellular
automata rules.
A parallel version called CMF_RANDOM is provided by Thinking Machines
[59].
Both the sequential and parallel versions of this generator have passed
many of the standard statistical tests [58, 59], however
CMF_RANDOM failed a Monte Carlo Ising model test
[23, 24] and therefore cannot be recommended.
This generator is also much slower than those provided in the CMSSL,
so it is not often used for large-scale simulations.
There are a number of other methods used for implementing
parallel random number generators,
including using a different generator for each processor.
These methods are not covered here, since they are not widely used.
Copyright © 1996
| <- HREF="node16.html" Prev | Index | Next -> |
NHSE ReviewTM: Comments
· Archive
· Search
Paul Coddington, paulc@npac.syr.edu