Random Number Generators on Vector Supercomputers and Other Advanced Architectures
From MaRDI portal
Publication:3490838
DOI10.1137/1032044zbMath0708.65004OpenAlexW1998122806MaRDI QIDQ3490838
Publication date: 1990
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1032044
efficiencyeffectivenessrandom number generatorsstatistical behaviourFortran programsvector supercomputersrandom number sequencenumerical statistical tests
Related Items (20)
Further results on multivariate vertical density representation and an application to random vector generation* ⋮ Binary sequences derived from monomial permutation polynomials over \(\mathrm{GF}(2^p)\) ⋮ A comparative study of some pseudorandom number generators ⋮ Systematic searches for good multiple recursive random number generators ⋮ Asymptotics in addition of pseudo-random sequences ⋮ On weakly correlated random numbers generator ⋮ Random numbers for parallel computers: requirements and methods, with emphasis on gpus ⋮ The limit behavior of sequences generated by parallel linear congruential generators ⋮ Some characterizations of the uniform distribution with applications to random number generation ⋮ Evidence of the correlation between positive Lyapunov exponents and good chaotic random number sequences ⋮ Parallel use of multiplicative congruential random number generators ⋮ Polynomial pseudo-random number generator via cyclic phase ⋮ On the Periods of Generalized Fibonacci Recurrences ⋮ On the CRAY-System Random Number Generator ⋮ Pseudorandom Vector Generation by the Multiple-Recursive Matrix Method ⋮ Uniform random number generation ⋮ Numerical simulation of randomly forced turbulent flows ⋮ Good random number generators are (not so) easy to find ⋮ Bad lattice points ⋮ Bit-parallel random number generation for discrete uniform distributions
Uses Software
This page was built for publication: Random Number Generators on Vector Supercomputers and Other Advanced Architectures
