论文信息 - Techniques for Testing the Quality of Parallel Pseudorandom Number Generators

Techniques for Testing the Quality of Parallel Pseudorandom Number Generators

Ensuring that pseudorandom number generators have good randomness properties is more complicated in a multiprocessor implementationthan in the uniprocessor case. We discuss simple extensions of uniprocessor testing for SIMD parallel streams, and develop in detail a repeatability test for the SPMD paradigm. Examples of the application of these tests to an additive lagged-Fibonacci generator are also given.

Michael Mascagni | Daniel V. Pryor | Steven A. Cuccaro

[1] George Marsaglia,et al. Toward a universal random number generator , 1987 .

[2] F. Warren Burton,et al. Distributed Random Number Generation , 1992, J. Funct. Program..

[3] Michael Mascagni,et al. Implementation of a portable and reproducible parallel pseudorandom number generator , 1994, Proceedings of Supercomputing '94.

[4] István Deák,et al. Uniform random number generators for parallel computers , 1990, Parallel Comput..

[5] Burton J. Smith,et al. Pseudo-random trees in Monte Carlo , 1984, Parallel Comput..

[6] Michael Mascagni,et al. A Fast, High Quality, and Reproducible Parallel Lagged-Fibonacci Pseudorandom Number Generator , 1995 .

[7] Richard P. Brent,et al. Uniform random number generators for supercomputers , 1992 .