A random number generator for parallel computers
From MaRDI portal
(Redirected from Publication:1200992)
An efficient parallelization of the generalized feedback shift register (GFSR) random number generator is presented. GFSR works on \(N=2^ m\) processors as a set of generators. The \(i\)-th generator produces the subsequence \(x_ i,x_{i+N}, x_{i+2N},\dots\) where \(x_ 0,x_ 1,x_ 2,x_ 3,\dots\) is the sequence generated by a nonparallel GFSR generator.
Recommendations
Cited in
(18)- Lagged-Fibonacci random number generators on parallel computers
- A universal GFSR random number generator for personal computers
- A parallel Poisson generator using parallel prefix
- Lagged Fibonacci random number generators for distributed memory parallel computers
- A fast random number generator for the Intel Paragon supercomputer
- A Fortran 90 interface to random number generation
- Random number generators for large-scale parallel Monte Carlo simulations on FPGA
- A hardware generator of multi-point distributed random numbers for Monte Carlo simulation
- Parallel algorithm for pseudorandom numbers generation
- Random Number Generators on Vector Supercomputers and Other Advanced Architectures
- Defects in parallel Monte Carlo and quasi-Monte Carlo integration using the leap-frog technique
- scientific article; zbMATH DE number 764432 (Why is no real title available?)
- Twisted GFSR generators
- Some lattice-based scientific problems, expressed in Haskell
- Making the RANMAR pseudorandom number generator in LAMMPS up to four times faster, with an implementation of jump-ahead
- Random number generators for parallel processors
- A class of parallel random number generators
- Uniform random number generators for parallel computers
This page was built for publication: A random number generator for parallel computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200992)