Random number generators for parallel processors
The fundamental requirements for the sequence of numbers produced by a random number generator in a computer program are that (i) the sequence be indistinguishable from that produced by an iid sequence of standard uniformly distributed random variables; (ii) 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 (iii) 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 of these requirements may be violated. The author reviews previous attempts to satisfy the three requirements for a multiprocessor and concludes that none are really successful.
- Compound Random Number Generators
- scientific article; zbMATH DE number 3070755 (Why is no real title available?)
- Pseudo-random trees in Monte Carlo
- Pseudorandom Number Assignment in Statistically Designed Simulation and Distribution Sampling Experiments
- Regularities in congruential random number generators
- Uniform Random Number Generators
- Parallel processing of random number generation for Monte Carlo turbulence simulation
- A random number generator for parallel computers
- Lagged Fibonacci random number generators for distributed memory parallel computers
- A fast random number generator for the Intel Paragon supercomputer
- On a new class of pseudorandom numbers for simulation methods
- Binary sequences derived from monomial permutation polynomials over \(\mathrm{GF}(2^p)\)
- Random numbers for parallel computers: requirements and methods, with emphasis on gpus
- Using rngstreams for parallel random number generation in C++ and R
- On the probability of overlap of random subsequences of pseudorandom number generators
- scientific article; zbMATH DE number 3858278 (Why is no real title available?)
- Parallel algorithm for pseudorandom numbers generation
- Random Number Generators on Vector Supercomputers and Other Advanced Architectures
- Efficient Parallel Pseudorandom Number Generation
- scientific article; zbMATH DE number 1251238 (Why is no real title available?)
- scientific article; zbMATH DE number 1305037 (Why is no real title available?)
- Pseudorandom Vector Generation by the Multiple-Recursive Matrix Method
- Defects in parallel Monte Carlo and quasi-Monte Carlo integration using the leap-frog technique
- Further results on multivariate vertical density representation and an application to random vector generation*
- Distributed random number generation
- scientific article; zbMATH DE number 764432 (Why is no real title available?)
- scientific article; zbMATH DE number 822310 (Why is no real title available?)
- scientific article; zbMATH DE number 833679 (Why is no real title available?)
- Evaluation of splittable pseudo-random generators
- A new empirical test for parallel pseudo-random number generators
- Parallel use of multiplicative congruential random number generators
- HASPRNG: hardware accelerated scalable parallel random number generators
- Uniform random number generators for parallel computers
This page was built for publication: Random number generators for parallel processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916296)
